/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 01:11:46,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 01:11:46,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 01:11:46,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 01:11:46,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 01:11:46,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 01:11:46,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 01:11:46,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 01:11:46,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 01:11:46,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 01:11:46,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 01:11:46,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 01:11:46,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 01:11:46,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 01:11:46,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 01:11:46,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 01:11:46,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 01:11:46,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 01:11:46,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 01:11:46,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 01:11:46,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 01:11:46,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 01:11:46,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 01:11:46,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 01:11:46,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 01:11:46,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 01:11:46,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 01:11:46,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 01:11:46,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 01:11:46,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 01:11:46,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 01:11:46,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 01:11:46,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 01:11:46,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 01:11:46,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 01:11:46,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 01:11:46,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 01:11:46,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 01:11:46,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 01:11:46,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 01:11:46,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 01:11:46,476 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-15 01:11:46,486 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 01:11:46,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 01:11:46,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 01:11:46,488 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 01:11:46,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 01:11:46,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 01:11:46,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 01:11:46,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 01:11:46,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 01:11:46,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 01:11:46,489 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 01:11:46,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 01:11:46,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 01:11:46,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 01:11:46,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 01:11:46,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 01:11:46,490 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 01:11:46,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 01:11:46,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 01:11:46,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 01:11:46,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-15 01:11:46,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 01:11:46,491 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-15 01:11:46,491 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-15 01:11:46,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 01:11:46,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 01:11:46,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 01:11:46,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 01:11:46,728 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 01:11:46,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c [2022-02-15 01:11:46,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4be9e698/371e45a69a9e4e6dabc91f7728516b21/FLAG5e4fa5238 [2022-02-15 01:11:47,136 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 01:11:47,137 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2022-02-15 01:11:47,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4be9e698/371e45a69a9e4e6dabc91f7728516b21/FLAG5e4fa5238 [2022-02-15 01:11:47,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4be9e698/371e45a69a9e4e6dabc91f7728516b21 [2022-02-15 01:11:47,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 01:11:47,565 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-15 01:11:47,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 01:11:47,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 01:11:47,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 01:11:47,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:11:47" (1/1) ... [2022-02-15 01:11:47,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71515a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:47, skipping insertion in model container [2022-02-15 01:11:47,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:11:47" (1/1) ... [2022-02-15 01:11:47,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 01:11:47,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 01:11:47,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c[383,396] [2022-02-15 01:11:47,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 01:11:47,724 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 01:11:47,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c[383,396] [2022-02-15 01:11:47,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 01:11:47,779 INFO L208 MainTranslator]: Completed translation [2022-02-15 01:11:47,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:47 WrapperNode [2022-02-15 01:11:47,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 01:11:47,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 01:11:47,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 01:11:47,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 01:11:47,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:47" (1/1) ... [2022-02-15 01:11:47,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:47" (1/1) ... [2022-02-15 01:11:47,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:47" (1/1) ... [2022-02-15 01:11:47,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:47" (1/1) ... [2022-02-15 01:11:47,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:47" (1/1) ... [2022-02-15 01:11:47,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:47" (1/1) ... [2022-02-15 01:11:47,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:47" (1/1) ... [2022-02-15 01:11:47,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 01:11:47,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 01:11:47,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 01:11:47,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 01:11:47,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:47" (1/1) ... [2022-02-15 01:11:47,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 01:11:47,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 01:11:47,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-15 01:11:47,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-15 01:11:47,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 01:11:47,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 01:11:47,898 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 01:11:47,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-15 01:11:47,899 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-02-15 01:11:47,899 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 01:11:47,899 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-15 01:11:47,900 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 01:11:47,900 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 01:11:47,900 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 01:11:47,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 01:11:47,901 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-02-15 01:11:47,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-15 01:11:47,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-02-15 01:11:47,902 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-02-15 01:11:47,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 01:11:47,904 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 01:11:47,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-15 01:11:47,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-15 01:11:47,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 01:11:47,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 01:11:47,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 01:11:47,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 01:11:47,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 01:11:47,992 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 01:11:47,994 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 01:11:50,260 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 01:11:50,265 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 01:11:50,266 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-15 01:11:50,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:11:50 BoogieIcfgContainer [2022-02-15 01:11:50,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 01:11:50,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 01:11:50,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 01:11:50,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 01:11:50,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:11:47" (1/3) ... [2022-02-15 01:11:50,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d43fc2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:11:50, skipping insertion in model container [2022-02-15 01:11:50,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:47" (2/3) ... [2022-02-15 01:11:50,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d43fc2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:11:50, skipping insertion in model container [2022-02-15 01:11:50,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:11:50" (3/3) ... [2022-02-15 01:11:50,278 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_search.c [2022-02-15 01:11:50,282 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-15 01:11:50,282 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 01:11:50,317 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 01:11:50,323 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=JORDAN [2022-02-15 01:11:50,323 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 01:11:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-15 01:11:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 01:11:50,341 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:11:50,341 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:11:50,342 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:11:50,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:11:50,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1001129449, now seen corresponding path program 1 times [2022-02-15 01:11:50,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:11:50,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1607633981] [2022-02-15 01:11:50,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:11:50,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:11:50,398 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:11:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:50,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:11:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:50,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-15 01:11:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:50,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 01:11:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:11:50,590 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:11:50,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1607633981] [2022-02-15 01:11:50,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1607633981] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:11:50,592 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:11:50,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 01:11:50,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255632761] [2022-02-15 01:11:50,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:11:50,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 01:11:50,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:11:50,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 01:11:50,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 01:11:50,620 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 01:11:50,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:11:50,710 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-02-15 01:11:50,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 01:11:50,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-02-15 01:11:50,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:11:50,717 INFO L225 Difference]: With dead ends: 52 [2022-02-15 01:11:50,718 INFO L226 Difference]: Without dead ends: 27 [2022-02-15 01:11:50,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-15 01:11:50,725 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:11:50,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 39 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:11:50,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-15 01:11:50,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-15 01:11:50,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 01:11:50,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-02-15 01:11:50,757 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-02-15 01:11:50,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:11:50,757 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-02-15 01:11:50,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 01:11:50,758 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-15 01:11:50,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-15 01:11:50,759 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:11:50,759 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:11:50,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 01:11:50,759 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:11:50,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:11:50,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2092261110, now seen corresponding path program 1 times [2022-02-15 01:11:50,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:11:50,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [246263827] [2022-02-15 01:11:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:11:50,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:11:50,763 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:11:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:50,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:11:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:50,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-15 01:11:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:50,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 01:11:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:11:50,947 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:11:50,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [246263827] [2022-02-15 01:11:50,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [246263827] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:11:50,952 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:11:50,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 01:11:50,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141186588] [2022-02-15 01:11:50,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:11:50,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 01:11:50,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:11:50,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 01:11:50,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-15 01:11:50,957 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 01:11:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:11:51,194 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-02-15 01:11:51,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 01:11:51,195 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-02-15 01:11:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:11:51,196 INFO L225 Difference]: With dead ends: 35 [2022-02-15 01:11:51,196 INFO L226 Difference]: Without dead ends: 27 [2022-02-15 01:11:51,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-02-15 01:11:51,197 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 01:11:51,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 50 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 01:11:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-15 01:11:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-15 01:11:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 01:11:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-02-15 01:11:51,205 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2022-02-15 01:11:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:11:51,205 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-02-15 01:11:51,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 01:11:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-15 01:11:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-15 01:11:51,206 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:11:51,207 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:11:51,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 01:11:51,207 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:11:51,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:11:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash -349450775, now seen corresponding path program 1 times [2022-02-15 01:11:51,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:11:51,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2070361154] [2022-02-15 01:11:51,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:11:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:11:51,210 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 01:11:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:51,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:11:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:51,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-15 01:11:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:51,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 01:11:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:11:51,408 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:11:51,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2070361154] [2022-02-15 01:11:51,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2070361154] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:11:51,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:11:51,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 01:11:51,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270823193] [2022-02-15 01:11:51,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:11:51,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 01:11:51,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:11:51,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 01:11:51,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-15 01:11:51,415 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-15 01:11:53,579 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 01:11:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:11:53,858 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-02-15 01:11:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 01:11:53,859 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-15 01:11:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:11:53,860 INFO L225 Difference]: With dead ends: 40 [2022-02-15 01:11:53,860 INFO L226 Difference]: Without dead ends: 31 [2022-02-15 01:11:53,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-02-15 01:11:53,862 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:11:53,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 38 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 89 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 01:11:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-15 01:11:53,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-02-15 01:11:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 01:11:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-02-15 01:11:53,875 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2022-02-15 01:11:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:11:53,875 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-02-15 01:11:53,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-15 01:11:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-15 01:11:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-15 01:11:53,876 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:11:53,877 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:11:53,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 01:11:53,877 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:11:53,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:11:53,877 INFO L85 PathProgramCache]: Analyzing trace with hash 33102019, now seen corresponding path program 1 times [2022-02-15 01:11:53,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:11:53,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1775120583] [2022-02-15 01:11:53,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:11:54,151 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:11:54,152 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:11:54,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:11:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:54,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:11:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:54,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-15 01:11:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:54,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 01:11:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:11:54,916 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:11:54,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1775120583] [2022-02-15 01:11:54,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1775120583] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:11:54,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:11:54,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-15 01:11:54,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226432352] [2022-02-15 01:11:54,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:11:54,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-15 01:11:54,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:11:54,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-15 01:11:54,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-02-15 01:11:54,918 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-15 01:11:57,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 01:11:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:11:57,967 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2022-02-15 01:11:57,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-15 01:11:57,971 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-02-15 01:11:57,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:11:57,974 INFO L225 Difference]: With dead ends: 52 [2022-02-15 01:11:57,974 INFO L226 Difference]: Without dead ends: 43 [2022-02-15 01:11:57,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=223, Invalid=1183, Unknown=0, NotChecked=0, Total=1406 [2022-02-15 01:11:57,976 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 58 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 01:11:57,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 57 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 168 Invalid, 1 Unknown, 75 Unchecked, 2.4s Time] [2022-02-15 01:11:57,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-15 01:11:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2022-02-15 01:11:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 01:11:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-02-15 01:11:57,988 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 29 [2022-02-15 01:11:57,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:11:57,988 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-02-15 01:11:57,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-15 01:11:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-15 01:11:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-15 01:11:57,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:11:57,989 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:11:57,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 01:11:57,990 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:11:57,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:11:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash -359924991, now seen corresponding path program 1 times [2022-02-15 01:11:57,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:11:57,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [202492141] [2022-02-15 01:11:57,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:11:58,127 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:11:58,128 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:11:58,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:11:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:58,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:11:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-15 01:11:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:58,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 01:11:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:11:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:11:58,611 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:11:58,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [202492141] [2022-02-15 01:11:58,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [202492141] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:11:58,612 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:11:58,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-15 01:11:58,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522046087] [2022-02-15 01:11:58,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:11:58,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-15 01:11:58,613 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:11:58,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-15 01:11:58,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-15 01:11:58,614 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-15 01:12:00,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 01:12:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:12:01,162 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-02-15 01:12:01,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-15 01:12:01,163 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-02-15 01:12:01,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:12:01,164 INFO L225 Difference]: With dead ends: 53 [2022-02-15 01:12:01,164 INFO L226 Difference]: Without dead ends: 35 [2022-02-15 01:12:01,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2022-02-15 01:12:01,165 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 77 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:12:01,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 42 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 01:12:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-15 01:12:01,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-02-15 01:12:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 01:12:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-02-15 01:12:01,176 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 29 [2022-02-15 01:12:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:12:01,176 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-02-15 01:12:01,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-15 01:12:01,176 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-02-15 01:12:01,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-15 01:12:01,177 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:12:01,177 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:12:01,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 01:12:01,177 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:12:01,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:12:01,178 INFO L85 PathProgramCache]: Analyzing trace with hash -978015231, now seen corresponding path program 2 times [2022-02-15 01:12:01,178 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:12:01,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1335558560] [2022-02-15 01:12:01,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:12:01,199 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:12:01,200 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-02-15 01:12:01,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:12:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:12:01,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:12:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:12:01,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-15 01:12:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:12:01,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 01:12:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:12:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:12:01,499 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:12:01,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1335558560] [2022-02-15 01:12:01,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1335558560] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:12:01,500 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:12:01,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-15 01:12:01,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090491235] [2022-02-15 01:12:01,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:12:01,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 01:12:01,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:12:01,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 01:12:01,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-15 01:12:01,501 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-15 01:12:03,645 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 01:12:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:12:03,966 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-02-15 01:12:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-15 01:12:03,967 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-02-15 01:12:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:12:03,968 INFO L225 Difference]: With dead ends: 48 [2022-02-15 01:12:03,968 INFO L226 Difference]: Without dead ends: 34 [2022-02-15 01:12:03,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-02-15 01:12:03,969 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 57 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 01:12:03,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 47 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 168 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 01:12:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-15 01:12:03,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-15 01:12:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 01:12:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-02-15 01:12:03,979 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 29 [2022-02-15 01:12:03,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:12:03,979 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-02-15 01:12:03,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-15 01:12:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-02-15 01:12:03,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-15 01:12:03,980 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:12:03,980 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:12:03,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 01:12:03,980 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:12:03,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:12:03,981 INFO L85 PathProgramCache]: Analyzing trace with hash -868933029, now seen corresponding path program 1 times [2022-02-15 01:12:03,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:12:03,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [502032641] [2022-02-15 01:12:03,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:12:04,173 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:12:09,992 WARN L228 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 105 DAG size of output: 100 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-02-15 01:12:09,995 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:12:09,995 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:12:11,120 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:12:11,121 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:12:11,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:12:11,134 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_14 (* (- 1) .aux_mod_v_it_5_51.0) (* (- 4294967296) .aux_div_v_it_5_51.1) 1) 0)) [2022-02-15 01:12:11,135 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 .aux_mod_v_it_5_51.0) (* (- 17179869184) (div .aux_mod_v_it_5_51.0 4294967296)) linear_search_~a.offset_13 (- 17179869184))) linear_search_~q_13)) [2022-02-15 01:12:11,135 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ .aux_mod_v_it_5_51.0 (* 4294967296 .aux_div_v_it_5_51.1) (* (- 1) linear_search_~j~0_16) 1) 0)) [2022-02-15 01:12:11,137 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_14 (* (- 1) .aux_mod_v_it_5_51.2) (* (- 4294967296) .aux_div_v_it_5_51.3) 1) 0)) [2022-02-15 01:12:11,137 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 .aux_mod_v_it_5_51.2) (* (- 17179869184) (div .aux_mod_v_it_5_51.2 4294967296)) linear_search_~a.offset_13)) linear_search_~q_13)) [2022-02-15 01:12:11,137 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ .aux_mod_v_it_5_51.2 (* 4294967296 .aux_div_v_it_5_51.3) (* (- 1) linear_search_~j~0_16) 1) 0)) [2022-02-15 01:12:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:12:11,187 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_14 (* (- 1) .aux_mod_v_it_5_51.9) (* (- 4294967296) .aux_div_v_it_5_51.10) 1) 0)) [2022-02-15 01:12:11,187 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 .aux_mod_v_it_5_51.9) (* (- 17179869184) (div .aux_mod_v_it_5_51.9 4294967296)) linear_search_~a.offset_13 (- 17179869184))) linear_search_~q_13)) [2022-02-15 01:12:11,187 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ .aux_mod_v_it_5_51.9 (* 4294967296 .aux_div_v_it_5_51.10) (* (- 1) linear_search_~j~0_16) 1) 0)) [2022-02-15 01:12:11,188 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_14 (* (- 1) .aux_mod_v_it_5_51.11) (* (- 4294967296) .aux_div_v_it_5_51.12) 1) 0)) [2022-02-15 01:12:11,188 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 .aux_mod_v_it_5_51.11) (* (- 17179869184) (div .aux_mod_v_it_5_51.11 4294967296)) linear_search_~a.offset_13)) linear_search_~q_13)) [2022-02-15 01:12:11,188 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ .aux_mod_v_it_5_51.11 (* 4294967296 .aux_div_v_it_5_51.12) (* (- 1) linear_search_~j~0_16) 1) 0)) [2022-02-15 01:12:11,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 01:12:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:12:11,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-15 01:12:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:12:11,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 01:12:11,416 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_1 (* (- 1) .aux_mod_v_it_5_51.14) (* (- 4294967296) .aux_div_v_it_5_51.15) 1) 0)) [2022-02-15 01:12:11,416 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 .aux_mod_v_it_5_51.14) (* (- 17179869184) (div .aux_mod_v_it_5_51.14 4294967296)) linear_search_~a.offset_0 (- 17179869184))) linear_search_~q_0)) [2022-02-15 01:12:11,417 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ .aux_mod_v_it_5_51.14 (* 4294967296 .aux_div_v_it_5_51.15) (* (- 1) linear_search_~j~0_3) 1) 0)) [2022-02-15 01:12:11,417 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_1 (* (- 1) .aux_mod_v_it_5_51.16) (* (- 4294967296) .aux_div_v_it_5_51.17) 1) 0)) [2022-02-15 01:12:11,417 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 .aux_mod_v_it_5_51.16) (* (- 17179869184) (div .aux_mod_v_it_5_51.16 4294967296)) linear_search_~a.offset_0)) linear_search_~q_0)) [2022-02-15 01:12:11,417 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ .aux_mod_v_it_5_51.16 (* 4294967296 .aux_div_v_it_5_51.17) (* (- 1) linear_search_~j~0_3) 1) 0)) [2022-02-15 01:12:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 01:12:11,443 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_1 (* (- 1) .aux_mod_v_it_5_51.30) (* (- 4294967296) .aux_div_v_it_5_51.31) 1) 0)) [2022-02-15 01:12:11,443 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 .aux_mod_v_it_5_51.30) (* (- 17179869184) (div .aux_mod_v_it_5_51.30 4294967296)) linear_search_~a.offset_0 (- 17179869184))) linear_search_~q_0)) [2022-02-15 01:12:11,443 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ .aux_mod_v_it_5_51.30 (* 4294967296 .aux_div_v_it_5_51.31) (* (- 1) linear_search_~j~0_3) 1) 0)) [2022-02-15 01:12:11,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_1 (* (- 1) .aux_mod_v_it_5_51.32) (* (- 4294967296) .aux_div_v_it_5_51.33) 1) 0)) [2022-02-15 01:12:11,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 .aux_mod_v_it_5_51.32) (* (- 17179869184) (div .aux_mod_v_it_5_51.32 4294967296)) linear_search_~a.offset_0)) linear_search_~q_0)) [2022-02-15 01:12:11,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ .aux_mod_v_it_5_51.32 (* 4294967296 .aux_div_v_it_5_51.33) (* (- 1) linear_search_~j~0_3) 1) 0)) [2022-02-15 01:12:12,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 01:12:13,334 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 01:12:13,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [502032641] [2022-02-15 01:12:13,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [502032641] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 01:12:13,335 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 01:12:13,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-02-15 01:12:13,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569208051] [2022-02-15 01:12:13,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 01:12:13,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-15 01:12:13,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 01:12:13,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-15 01:12:13,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2022-02-15 01:12:13,336 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 27 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 01:12:15,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 01:12:17,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 01:12:19,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 01:12:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 01:12:20,964 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-02-15 01:12:20,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-15 01:12:20,965 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-02-15 01:12:20,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 01:12:20,966 INFO L225 Difference]: With dead ends: 59 [2022-02-15 01:12:20,966 INFO L226 Difference]: Without dead ends: 47 [2022-02-15 01:12:20,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=214, Invalid=1592, Unknown=0, NotChecked=0, Total=1806 [2022-02-15 01:12:20,967 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 40 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-02-15 01:12:20,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 56 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 250 Invalid, 3 Unknown, 82 Unchecked, 6.7s Time] [2022-02-15 01:12:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-15 01:12:20,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-02-15 01:12:20,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 01:12:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-02-15 01:12:20,981 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 33 [2022-02-15 01:12:20,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 01:12:20,981 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-02-15 01:12:20,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 22 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 01:12:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-02-15 01:12:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-15 01:12:20,982 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 01:12:20,982 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 01:12:20,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 01:12:20,982 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 01:12:20,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 01:12:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1261960039, now seen corresponding path program 1 times [2022-02-15 01:12:20,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 01:12:20,983 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [839008882] [2022-02-15 01:12:20,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 01:12:21,133 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-15 01:12:23,690 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:12:23,690 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:12:26,478 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-15 01:12:26,479 INFO L262 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-02-15 01:12:26,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 01:12:26,491 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_13 (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 .aux_mod_v_it_8_51.1) (* (- 17179869184) (div .aux_mod_v_it_8_51.1 4294967296)) linear_search_~a.offset_13 (- 17179869184))))) [2022-02-15 01:12:26,492 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ .aux_mod_v_it_8_51.1 (* 4294967296 .aux_div_v_it_8_51.0) (* (- 1) linear_search_~j~0_16) 1) 0)) [2022-02-15 01:12:26,492 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_14 (* (- 1) .aux_mod_v_it_8_51.1) (* (- 4294967296) .aux_div_v_it_8_51.0) 1) 0)) [2022-02-15 01:12:26,492 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ .aux_mod_v_it_8_51.3 (* 4294967296 .aux_div_v_it_8_51.2) (* (- 1) linear_search_~j~0_16) 1) 0)) [2022-02-15 01:12:26,493 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_13 (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 .aux_mod_v_it_8_51.3) (* (- 17179869184) (div .aux_mod_v_it_8_51.3 4294967296)) linear_search_~a.offset_13)))) [2022-02-15 01:12:26,493 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_14 (* (- 1) .aux_mod_v_it_8_51.3) (* (- 4294967296) .aux_div_v_it_8_51.2) 1) 0)) [2022-02-15 01:12:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-02-15 01:12:26,528 WARN L132 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2022-02-15 01:12:26,528 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2022-02-15 01:12:26,539 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 01:12:26,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 01:12:26,548 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-02-15 01:12:26,550 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 01:12:26,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:12:26 BoogieIcfgContainer [2022-02-15 01:12:26,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 01:12:26,562 INFO L158 Benchmark]: Toolchain (without parser) took 38997.88ms. Allocated memory was 185.6MB in the beginning and 259.0MB in the end (delta: 73.4MB). Free memory was 130.2MB in the beginning and 166.9MB in the end (delta: -36.7MB). Peak memory consumption was 38.1MB. Max. memory is 8.0GB. [2022-02-15 01:12:26,563 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 01:12:26,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.19ms. Allocated memory was 185.6MB in the beginning and 259.0MB in the end (delta: 73.4MB). Free memory was 130.1MB in the beginning and 232.1MB in the end (delta: -102.0MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. [2022-02-15 01:12:26,564 INFO L158 Benchmark]: Boogie Preprocessor took 35.51ms. Allocated memory is still 259.0MB. Free memory was 232.1MB in the beginning and 230.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-15 01:12:26,564 INFO L158 Benchmark]: RCFGBuilder took 2450.52ms. Allocated memory is still 259.0MB. Free memory was 230.5MB in the beginning and 217.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-02-15 01:12:26,565 INFO L158 Benchmark]: TraceAbstraction took 36293.33ms. Allocated memory is still 259.0MB. Free memory was 217.4MB in the beginning and 166.9MB in the end (delta: 50.5MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. [2022-02-15 01:12:26,568 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.19ms. Allocated memory was 185.6MB in the beginning and 259.0MB in the end (delta: 73.4MB). Free memory was 130.1MB in the beginning and 232.1MB in the end (delta: -102.0MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.51ms. Allocated memory is still 259.0MB. Free memory was 232.1MB in the beginning and 230.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 2450.52ms. Allocated memory is still 259.0MB. Free memory was 230.5MB in the beginning and 217.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 36293.33ms. Allocated memory is still 259.0MB. Free memory was 217.4MB in the beginning and 166.9MB in the end (delta: 50.5MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 8]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L13] unsigned int SIZE; [L14] const unsigned int MAX = 100000; [L25] SIZE=(__VERIFIER_nondet_uint()/2)+1 [L27] COND TRUE SIZE > 1 && SIZE < MAX [L28] EXPR, FCALL calloc(SIZE,sizeof(int)) [L28] int *a = calloc(SIZE,sizeof(int)); [L29] a[SIZE/2]=3 [L30] CALL, EXPR linear_search(a,SIZE,3) [L16] unsigned int j=0; [L17] j