./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-49.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c80d74e822ccb5bc679c42c7c198bebe68062bcb54648d4262123ad3e2d9aacd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:06:01,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:06:01,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:06:01,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:06:01,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:06:01,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:06:01,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:06:01,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:06:01,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:06:01,483 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:06:01,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:06:01,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:06:01,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:06:01,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:06:01,487 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:06:01,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:06:01,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:06:01,488 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:06:01,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:06:01,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:06:01,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:06:01,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:06:01,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:06:01,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:06:01,495 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:06:01,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:06:01,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:06:01,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:06:01,496 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:06:01,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:06:01,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:06:01,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:06:01,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:06:01,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:06:01,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:06:01,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:06:01,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:06:01,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:06:01,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:06:01,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:06:01,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:06:01,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:06:01,501 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c80d74e822ccb5bc679c42c7c198bebe68062bcb54648d4262123ad3e2d9aacd [2024-11-16 17:06:01,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:06:01,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:06:01,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:06:01,839 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:06:01,839 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:06:01,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-49.i [2024-11-16 17:06:03,404 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:06:03,693 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:06:03,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-49.i [2024-11-16 17:06:03,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f8976fd/25ec0d0c1ecc4d4499ab2ff9c5f7126e/FLAGc31f7392c [2024-11-16 17:06:03,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f8976fd/25ec0d0c1ecc4d4499ab2ff9c5f7126e [2024-11-16 17:06:03,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:06:03,997 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:06:03,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:06:03,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:06:04,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:06:04,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:06:03" (1/1) ... [2024-11-16 17:06:04,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@333cc188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:04, skipping insertion in model container [2024-11-16 17:06:04,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:06:03" (1/1) ... [2024-11-16 17:06:04,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:06:04,217 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-49.i[916,929] [2024-11-16 17:06:04,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:06:04,308 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:06:04,321 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-49.i[916,929] [2024-11-16 17:06:04,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:06:04,392 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:06:04,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:04 WrapperNode [2024-11-16 17:06:04,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:06:04,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:06:04,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:06:04,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:06:04,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:04" (1/1) ... [2024-11-16 17:06:04,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:04" (1/1) ... [2024-11-16 17:06:04,475 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-11-16 17:06:04,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:06:04,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:06:04,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:06:04,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:06:04,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:04" (1/1) ... [2024-11-16 17:06:04,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:04" (1/1) ... [2024-11-16 17:06:04,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:04" (1/1) ... [2024-11-16 17:06:04,525 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 17:06:04,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:04" (1/1) ... [2024-11-16 17:06:04,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:04" (1/1) ... [2024-11-16 17:06:04,540 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:04" (1/1) ... [2024-11-16 17:06:04,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:04" (1/1) ... [2024-11-16 17:06:04,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:04" (1/1) ... [2024-11-16 17:06:04,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:04" (1/1) ... [2024-11-16 17:06:04,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:06:04,555 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:06:04,555 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:06:04,555 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:06:04,556 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:04" (1/1) ... [2024-11-16 17:06:04,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:06:04,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:06:04,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 17:06:04,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 17:06:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:06:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:06:04,648 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:06:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:06:04,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:06:04,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:06:04,725 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:06:04,727 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:06:05,362 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-16 17:06:05,363 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:06:05,385 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:06:05,385 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:06:05,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:06:05 BoogieIcfgContainer [2024-11-16 17:06:05,386 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:06:05,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:06:05,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:06:05,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:06:05,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:06:03" (1/3) ... [2024-11-16 17:06:05,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf60402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:06:05, skipping insertion in model container [2024-11-16 17:06:05,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:04" (2/3) ... [2024-11-16 17:06:05,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf60402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:06:05, skipping insertion in model container [2024-11-16 17:06:05,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:06:05" (3/3) ... [2024-11-16 17:06:05,402 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-49.i [2024-11-16 17:06:05,422 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:06:05,422 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:06:05,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:06:05,504 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@215d2beb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:06:05,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:06:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 17:06:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 17:06:05,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:06:05,529 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:06:05,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:06:05,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:06:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash 782010630, now seen corresponding path program 1 times [2024-11-16 17:06:05,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:06:05,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810234159] [2024-11-16 17:06:05,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:06:05,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:06:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:05,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:06:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:05,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:06:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:05,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 17:06:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:06:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:06:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:06:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 17:06:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 17:06:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 17:06:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:06:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:06:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 17:06:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 17:06:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 17:06:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 17:06:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 17:06:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 17:06:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 17:06:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 17:06:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 17:06:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 17:06:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 17:06:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 17:06:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 17:06:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 17:06:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 17:06:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 17:06:06,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:06:06,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810234159] [2024-11-16 17:06:06,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810234159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:06:06,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:06:06,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:06:06,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636984505] [2024-11-16 17:06:06,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:06:06,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:06:06,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:06:06,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:06:06,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:06:06,259 INFO L87 Difference]: Start difference. First operand has 89 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 17:06:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:06:06,303 INFO L93 Difference]: Finished difference Result 170 states and 293 transitions. [2024-11-16 17:06:06,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:06:06,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2024-11-16 17:06:06,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:06:06,318 INFO L225 Difference]: With dead ends: 170 [2024-11-16 17:06:06,319 INFO L226 Difference]: Without dead ends: 84 [2024-11-16 17:06:06,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:06:06,329 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:06:06,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:06:06,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-16 17:06:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-16 17:06:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 17:06:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2024-11-16 17:06:06,401 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 173 [2024-11-16 17:06:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:06:06,402 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2024-11-16 17:06:06,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 17:06:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2024-11-16 17:06:06,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 17:06:06,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:06:06,409 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:06:06,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:06:06,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:06:06,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:06:06,411 INFO L85 PathProgramCache]: Analyzing trace with hash 619811310, now seen corresponding path program 1 times [2024-11-16 17:06:06,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:06:06,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667069554] [2024-11-16 17:06:06,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:06:06,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:06:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:06:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:06:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 17:06:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:06:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:06:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:06:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 17:06:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 17:06:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 17:06:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:06:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:06:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 17:06:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 17:06:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 17:06:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 17:06:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:06,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 17:06:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:07,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 17:06:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:07,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 17:06:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:07,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 17:06:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:07,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 17:06:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:07,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 17:06:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:07,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 17:06:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:07,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 17:06:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:07,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 17:06:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:07,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 17:06:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:07,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 17:06:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 17:06:07,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:06:07,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667069554] [2024-11-16 17:06:07,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667069554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:06:07,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:06:07,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 17:06:07,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579989952] [2024-11-16 17:06:07,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:06:07,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:06:07,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:06:07,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:06:07,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:06:07,084 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 17:06:07,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:06:07,189 INFO L93 Difference]: Finished difference Result 246 states and 381 transitions. [2024-11-16 17:06:07,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:06:07,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-16 17:06:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:06:07,197 INFO L225 Difference]: With dead ends: 246 [2024-11-16 17:06:07,197 INFO L226 Difference]: Without dead ends: 165 [2024-11-16 17:06:07,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:06:07,202 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 74 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:06:07,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 361 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:06:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-16 17:06:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2024-11-16 17:06:07,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 107 states have internal predecessors, (148), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 17:06:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 252 transitions. [2024-11-16 17:06:07,256 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 252 transitions. Word has length 173 [2024-11-16 17:06:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:06:07,258 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 252 transitions. [2024-11-16 17:06:07,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 17:06:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 252 transitions. [2024-11-16 17:06:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 17:06:07,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:06:07,264 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:06:07,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:06:07,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:06:07,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:06:07,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2127363119, now seen corresponding path program 1 times [2024-11-16 17:06:07,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:06:07,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555118182] [2024-11-16 17:06:07,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:06:07,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:06:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:08,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:06:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:08,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:06:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:08,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 17:06:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:08,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:06:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:08,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:06:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:08,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:06:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:08,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 17:06:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:08,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 17:06:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:08,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 17:06:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:08,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:06:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:08,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:06:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:08,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 17:06:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:08,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 17:06:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:09,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 17:06:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:09,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 17:06:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:09,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 17:06:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:09,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 17:06:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:09,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 17:06:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:09,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 17:06:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:09,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 17:06:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:09,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 17:06:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:09,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 17:06:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:09,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 17:06:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:09,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 17:06:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:09,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 17:06:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:09,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 17:06:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 17:06:09,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:06:09,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555118182] [2024-11-16 17:06:09,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555118182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:06:09,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:06:09,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 17:06:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614418448] [2024-11-16 17:06:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:06:09,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 17:06:09,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:06:09,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 17:06:09,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:06:09,063 INFO L87 Difference]: Start difference. First operand 162 states and 252 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 17:06:09,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:06:09,598 INFO L93 Difference]: Finished difference Result 539 states and 830 transitions. [2024-11-16 17:06:09,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 17:06:09,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-16 17:06:09,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:06:09,621 INFO L225 Difference]: With dead ends: 539 [2024-11-16 17:06:09,623 INFO L226 Difference]: Without dead ends: 380 [2024-11-16 17:06:09,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:06:09,628 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 184 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 17:06:09,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 458 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 17:06:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-16 17:06:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 370. [2024-11-16 17:06:09,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 243 states have (on average 1.3621399176954732) internal successors, (331), 247 states have internal predecessors, (331), 120 states have call successors, (120), 6 states have call predecessors, (120), 6 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-16 17:06:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 571 transitions. [2024-11-16 17:06:09,726 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 571 transitions. Word has length 173 [2024-11-16 17:06:09,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:06:09,728 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 571 transitions. [2024-11-16 17:06:09,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 17:06:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 571 transitions. [2024-11-16 17:06:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 17:06:09,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:06:09,731 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:06:09,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 17:06:09,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:06:09,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:06:09,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2038521458, now seen corresponding path program 1 times [2024-11-16 17:06:09,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:06:09,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44975882] [2024-11-16 17:06:09,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:06:09,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:06:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:06:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:06:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 17:06:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:06:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:06:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:06:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 17:06:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 17:06:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 17:06:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:06:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:06:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 17:06:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 17:06:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 17:06:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 17:06:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 17:06:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 17:06:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 17:06:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 17:06:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 17:06:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 17:06:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 17:06:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 17:06:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 17:06:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 17:06:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 17:06:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 17:06:10,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:06:10,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44975882] [2024-11-16 17:06:10,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44975882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:06:10,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:06:10,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 17:06:10,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525131117] [2024-11-16 17:06:10,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:06:10,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:06:10,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:06:10,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:06:10,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:06:10,082 INFO L87 Difference]: Start difference. First operand 370 states and 571 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 17:06:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:06:10,313 INFO L93 Difference]: Finished difference Result 1026 states and 1573 transitions. [2024-11-16 17:06:10,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:06:10,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-16 17:06:10,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:06:10,327 INFO L225 Difference]: With dead ends: 1026 [2024-11-16 17:06:10,327 INFO L226 Difference]: Without dead ends: 659 [2024-11-16 17:06:10,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:06:10,334 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 73 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:06:10,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 311 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:06:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-16 17:06:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 484. [2024-11-16 17:06:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 331 states have (on average 1.3746223564954683) internal successors, (455), 337 states have internal predecessors, (455), 144 states have call successors, (144), 8 states have call predecessors, (144), 8 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2024-11-16 17:06:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 743 transitions. [2024-11-16 17:06:10,421 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 743 transitions. Word has length 173 [2024-11-16 17:06:10,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:06:10,422 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 743 transitions. [2024-11-16 17:06:10,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 17:06:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 743 transitions. [2024-11-16 17:06:10,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-16 17:06:10,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:06:10,426 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:06:10,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 17:06:10,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:06:10,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:06:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1612511509, now seen corresponding path program 1 times [2024-11-16 17:06:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:06:10,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400562034] [2024-11-16 17:06:10,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:06:10,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:06:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:06:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:06:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 17:06:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:06:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:06:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:06:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 17:06:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 17:06:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 17:06:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:06:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:06:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 17:06:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 17:06:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 17:06:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 17:06:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 17:06:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 17:06:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 17:06:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 17:06:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 17:06:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 17:06:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 17:06:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 17:06:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 17:06:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 17:06:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 17:06:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 17:06:11,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:06:11,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400562034] [2024-11-16 17:06:11,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400562034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:06:11,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:06:11,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 17:06:11,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918670826] [2024-11-16 17:06:11,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:06:11,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 17:06:11,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:06:11,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 17:06:11,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:06:11,579 INFO L87 Difference]: Start difference. First operand 484 states and 743 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 17:06:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:06:12,090 INFO L93 Difference]: Finished difference Result 1310 states and 1988 transitions. [2024-11-16 17:06:12,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 17:06:12,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-16 17:06:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:06:12,097 INFO L225 Difference]: With dead ends: 1310 [2024-11-16 17:06:12,097 INFO L226 Difference]: Without dead ends: 829 [2024-11-16 17:06:12,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:06:12,100 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 356 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 17:06:12,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 418 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 17:06:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-11-16 17:06:12,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 491. [2024-11-16 17:06:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 338 states have (on average 1.3727810650887573) internal successors, (464), 344 states have internal predecessors, (464), 144 states have call successors, (144), 8 states have call predecessors, (144), 8 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2024-11-16 17:06:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 752 transitions. [2024-11-16 17:06:12,162 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 752 transitions. Word has length 174 [2024-11-16 17:06:12,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:06:12,162 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 752 transitions. [2024-11-16 17:06:12,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 17:06:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 752 transitions. [2024-11-16 17:06:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-16 17:06:12,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:06:12,165 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:06:12,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 17:06:12,165 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:06:12,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:06:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1319108502, now seen corresponding path program 1 times [2024-11-16 17:06:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:06:12,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514926385] [2024-11-16 17:06:12,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:06:12,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:06:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 17:06:12,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [432777076] [2024-11-16 17:06:12,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:06:12,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:06:12,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:06:12,344 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 17:06:12,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 17:06:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:06:12,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 17:06:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:06:13,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 17:06:13,037 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 17:06:13,038 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:06:13,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 17:06:13,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 17:06:13,248 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 17:06:13,389 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:06:13,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:06:13 BoogieIcfgContainer [2024-11-16 17:06:13,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:06:13,397 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:06:13,397 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:06:13,398 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:06:13,399 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:06:05" (3/4) ... [2024-11-16 17:06:13,402 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 17:06:13,403 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:06:13,405 INFO L158 Benchmark]: Toolchain (without parser) took 9407.21ms. Allocated memory was 159.4MB in the beginning and 285.2MB in the end (delta: 125.8MB). Free memory was 118.0MB in the beginning and 199.2MB in the end (delta: -81.3MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2024-11-16 17:06:13,405 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 98.6MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:06:13,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.30ms. Allocated memory is still 159.4MB. Free memory was 118.0MB in the beginning and 100.1MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 17:06:13,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.58ms. Allocated memory is still 159.4MB. Free memory was 100.1MB in the beginning and 96.0MB in the end (delta: 4.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 17:06:13,406 INFO L158 Benchmark]: Boogie Preprocessor took 77.96ms. Allocated memory is still 159.4MB. Free memory was 96.0MB in the beginning and 89.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 17:06:13,406 INFO L158 Benchmark]: IcfgBuilder took 830.80ms. Allocated memory is still 159.4MB. Free memory was 89.7MB in the beginning and 109.2MB in the end (delta: -19.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 17:06:13,406 INFO L158 Benchmark]: TraceAbstraction took 8007.33ms. Allocated memory was 159.4MB in the beginning and 285.2MB in the end (delta: 125.8MB). Free memory was 109.2MB in the beginning and 200.3MB in the end (delta: -91.1MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-11-16 17:06:13,407 INFO L158 Benchmark]: Witness Printer took 6.25ms. Allocated memory is still 285.2MB. Free memory was 200.3MB in the beginning and 199.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:06:13,408 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 98.6MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.30ms. Allocated memory is still 159.4MB. Free memory was 118.0MB in the beginning and 100.1MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.58ms. Allocated memory is still 159.4MB. Free memory was 100.1MB in the beginning and 96.0MB in the end (delta: 4.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.96ms. Allocated memory is still 159.4MB. Free memory was 96.0MB in the beginning and 89.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 830.80ms. Allocated memory is still 159.4MB. Free memory was 89.7MB in the beginning and 109.2MB in the end (delta: -19.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8007.33ms. Allocated memory was 159.4MB in the beginning and 285.2MB in the end (delta: 125.8MB). Free memory was 109.2MB in the beginning and 200.3MB in the end (delta: -91.1MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Witness Printer took 6.25ms. Allocated memory is still 285.2MB. Free memory was 200.3MB in the beginning and 199.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someUnaryDOUBLEoperation at line 42, overapproximation of someBinaryArithmeticDOUBLEoperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 188. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 16; [L23] signed char var_1_3 = -5; [L24] double var_1_5 = 2.65; [L25] double var_1_6 = 100.375; [L26] double var_1_7 = 5.7; [L27] double var_1_8 = 0.1; [L28] double var_1_9 = 9999.4; [L29] double var_1_10 = 63.375; [L30] signed char var_1_11 = 1; [L31] double var_1_12 = 3.875; [L32] unsigned long int var_1_13 = 2; [L33] double var_1_14 = 1.375; [L34] float var_1_16 = 32.4; [L35] double var_1_17 = 255.25; [L36] unsigned char var_1_19 = 1; [L37] unsigned char var_1_20 = 1; [L38] unsigned char var_1_21 = 50; [L39] unsigned char var_1_22 = 1; [L40] unsigned char var_1_23 = 0; [L41] unsigned char var_1_24 = 0; [L42] double var_1_25 = -0.8; [L43] unsigned short int var_1_26 = 16; [L44] signed short int var_1_28 = -32; [L45] signed short int var_1_29 = 5; [L46] unsigned char var_1_30 = 0; [L47] unsigned char var_1_31 = 0; [L48] float last_1_var_1_16 = 32.4; [L49] unsigned char last_1_var_1_19 = 1; [L50] unsigned char last_1_var_1_30 = 0; VAL [isInitial=0, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-5, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L183] last_1_var_1_16 = var_1_16 [L184] last_1_var_1_19 = var_1_19 [L185] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-5, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L141] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L142] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L142] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L143] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L143] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L144] var_1_6 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L146] var_1_7 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_8=1/10, var_1_9=49997/5] [L147] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_8=1/10, var_1_9=49997/5] [L148] var_1_8 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_9=49997/5] [L149] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20, var_1_9=49997/5] [L150] var_1_9 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L151] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L152] var_1_11 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L153] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L154] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L154] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L155] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L155] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L156] var_1_12 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L157] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L158] var_1_14 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L159] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L160] var_1_20 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_20 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L161] RET assume_abort_if_not(var_1_20 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L162] CALL assume_abort_if_not(var_1_20 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L162] RET assume_abort_if_not(var_1_20 <= 128) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L163] var_1_21 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_21 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L164] RET assume_abort_if_not(var_1_21 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L165] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L165] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L166] var_1_22 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L167] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L168] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L168] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L169] var_1_23 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L170] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L171] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L171] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L172] var_1_24 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L173] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L174] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L174] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L175] var_1_29 = __VERIFIER_nondet_short() [L176] CALL assume_abort_if_not(var_1_29 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L176] RET assume_abort_if_not(var_1_29 >= -16383) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L177] CALL assume_abort_if_not(var_1_29 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L177] RET assume_abort_if_not(var_1_29 <= 16383) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=0, var_1_3=-1, var_1_5=53/20] [L178] var_1_31 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_31 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=53/20] [L179] RET assume_abort_if_not(var_1_31 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=53/20] [L180] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=53/20] [L180] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=53/20] [L196] RET updateVariables() [L197] CALL step() [L54] unsigned char stepLocal_6 = var_1_24; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_6=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=53/20] [L55] COND FALSE !(last_1_var_1_30 || stepLocal_6) [L66] var_1_26 = var_1_20 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=53/20] [L68] COND TRUE (var_1_6 * (var_1_8 * var_1_7)) > (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12))) - var_1_14) [L69] var_1_13 = (128u + var_1_26) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=53/20] [L73] unsigned short int stepLocal_0 = var_1_26; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_0=128, var_1_10=507/8, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=53/20] [L74] COND FALSE !((-32 * (var_1_13 / var_1_3)) >= stepLocal_0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=53/20] [L77] signed long int stepLocal_7 = - 1000; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_7=-1000, var_1_10=507/8, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-32, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=53/20] [L78] COND TRUE stepLocal_7 <= (var_1_21 - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) [L79] var_1_28 = (var_1_29 + var_1_1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=53/20] [L83] signed long int stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_1=16, var_1_10=507/8, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=53/20] [L84] COND FALSE !(stepLocal_1 >= 32) [L87] var_1_5 = 0.8 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=4/5] [L89] COND TRUE var_1_3 != (var_1_1 / ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) [L90] var_1_10 = (var_1_9 - ((((((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) < (var_1_7)) ? (((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=4/5] [L94] signed long int stepLocal_2 = var_1_26 % (var_1_20 + var_1_21); VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_2=128, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=4/5] [L95] COND FALSE !(stepLocal_2 <= (~ ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) [L98] var_1_19 = (! var_1_22) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=4/5] [L100] signed char stepLocal_5 = var_1_11; [L101] unsigned short int stepLocal_4 = var_1_26; [L102] unsigned char stepLocal_3 = var_1_20; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=-640, stepLocal_4=128, stepLocal_5=-15, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=4/5] [L103] COND TRUE stepLocal_4 >= var_1_20 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=-640, stepLocal_5=-15, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=4/5] [L104] COND FALSE !(stepLocal_5 > var_1_26) [L113] var_1_25 = var_1_8 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=-640, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=4/5, var_1_8=2] [L116] signed long int stepLocal_8 = (0 ^ var_1_1) + var_1_29; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=-640, stepLocal_8=-16367, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=0, var_1_31=1, var_1_3=-1, var_1_5=4/5, var_1_8=2] [L117] COND TRUE stepLocal_8 < var_1_11 [L118] var_1_30 = (var_1_22 && (var_1_19 || var_1_31)) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=-640, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_5=4/5, var_1_8=2] [L122] COND FALSE !((var_1_5 != var_1_12) && var_1_30) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=-640, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_5=4/5, var_1_8=2] [L133] COND FALSE !(var_1_25 >= var_1_9) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=-640, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_5=4/5, var_1_8=2] [L197] RET step() [L198] CALL, EXPR property() [L188-L189] return ((((((((((((-32 * (var_1_13 / var_1_3)) >= var_1_26) ? (var_1_1 == ((signed long int) ((((var_1_3 + var_1_13) < 0 ) ? -(var_1_3 + var_1_13) : (var_1_3 + var_1_13))))) : 1) && ((var_1_1 >= 32) ? (var_1_5 == ((double) (var_1_6 - ((var_1_7 + var_1_8) + var_1_9)))) : (var_1_5 == ((double) 0.8)))) && ((var_1_3 != (var_1_1 / ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10 == ((double) (var_1_9 - ((((((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) < (var_1_7)) ? (((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) : (var_1_7)))))) : (var_1_10 == ((double) ((((var_1_6) > (var_1_8)) ? (var_1_6) : (var_1_8))))))) && (((var_1_6 * (var_1_8 * var_1_7)) > (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12))) - var_1_14)) ? (var_1_13 == ((unsigned long int) (128u + var_1_26))) : (var_1_13 == ((unsigned long int) var_1_26)))) && ((var_1_25 >= var_1_9) ? ((var_1_9 < var_1_14) ? (var_1_16 == ((float) var_1_8)) : 1) : 1)) && (((var_1_5 != var_1_12) && var_1_30) ? ((var_1_12 >= (var_1_9 * var_1_7)) ? ((var_1_11 >= var_1_26) ? (var_1_17 == ((double) var_1_12)) : (var_1_17 == ((double) var_1_7))) : (var_1_17 == ((double) var_1_6))) : 1)) && (((var_1_26 % (var_1_20 + var_1_21)) <= (~ ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) ? (var_1_19 == ((unsigned char) (((! var_1_22) || var_1_23) || var_1_24))) : (var_1_19 == ((unsigned char) (! var_1_22))))) && ((var_1_26 >= var_1_20) ? ((var_1_11 > var_1_26) ? (((((((10) > (var_1_3)) ? (10) : (var_1_3))) + var_1_28) >= var_1_20) ? ((! var_1_19) ? (var_1_25 == ((double) (var_1_9 - var_1_8))) : 1) : (var_1_25 == ((double) var_1_9))) : (var_1_25 == ((double) var_1_8))) : 1)) && ((last_1_var_1_30 || var_1_24) ? (last_1_var_1_19 ? (var_1_26 == ((unsigned short int) ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))))) : ((var_1_12 == last_1_var_1_16) ? (var_1_23 ? (var_1_26 == ((unsigned short int) var_1_20)) : 1) : 1)) : (var_1_26 == ((unsigned short int) var_1_20)))) && (((- 1000) <= (var_1_21 - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (var_1_28 == ((signed short int) (var_1_29 + var_1_1))) : (var_1_28 == ((signed short int) -5)))) && ((((0 ^ var_1_1) + var_1_29) < var_1_11) ? (var_1_30 == ((unsigned char) (var_1_22 && (var_1_19 || var_1_31)))) : (var_1_30 == ((unsigned char) var_1_22))) ; VAL [\result=0, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_5=4/5, var_1_8=2] [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_5=4/5, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-15, var_1_13=256, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=16, var_1_20=-640, var_1_21=1, var_1_22=-255, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-16367, var_1_29=-16383, var_1_30=1, var_1_31=1, var_1_3=-1, var_1_5=4/5, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 687 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 687 mSDsluCounter, 1677 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 919 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 372 IncrementalHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 758 mSDtfsCounter, 372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491occurred in iteration=5, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 526 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1214 NumberOfCodeBlocks, 1214 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 861 ConstructedInterpolants, 0 QuantifiedInterpolants, 1710 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6500/6500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 17:06:13,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-49.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c80d74e822ccb5bc679c42c7c198bebe68062bcb54648d4262123ad3e2d9aacd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:06:15,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:06:15,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 17:06:15,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:06:15,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:06:15,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:06:15,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:06:15,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:06:15,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:06:15,850 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:06:15,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:06:15,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:06:15,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:06:15,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:06:15,852 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:06:15,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:06:15,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:06:15,854 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:06:15,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:06:15,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:06:15,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:06:15,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:06:15,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:06:15,859 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 17:06:15,859 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 17:06:15,860 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:06:15,860 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 17:06:15,860 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:06:15,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:06:15,861 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:06:15,861 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:06:15,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:06:15,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:06:15,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:06:15,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:06:15,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:06:15,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:06:15,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:06:15,863 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 17:06:15,863 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 17:06:15,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:06:15,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:06:15,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:06:15,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:06:15,864 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c80d74e822ccb5bc679c42c7c198bebe68062bcb54648d4262123ad3e2d9aacd [2024-11-16 17:06:16,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:06:16,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:06:16,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:06:16,246 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:06:16,247 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:06:16,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-49.i [2024-11-16 17:06:17,701 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:06:17,936 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:06:17,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-49.i [2024-11-16 17:06:17,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68742ee0b/57c47bba73ca43e88b1b0a007eddb1a2/FLAG93e767844 [2024-11-16 17:06:18,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68742ee0b/57c47bba73ca43e88b1b0a007eddb1a2 [2024-11-16 17:06:18,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:06:18,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:06:18,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:06:18,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:06:18,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:06:18,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:06:18" (1/1) ... [2024-11-16 17:06:18,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eba63f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:18, skipping insertion in model container [2024-11-16 17:06:18,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:06:18" (1/1) ... [2024-11-16 17:06:18,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:06:18,536 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-49.i[916,929] [2024-11-16 17:06:18,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:06:18,666 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:06:18,680 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-49.i[916,929] [2024-11-16 17:06:18,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:06:18,759 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:06:18,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:18 WrapperNode [2024-11-16 17:06:18,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:06:18,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:06:18,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:06:18,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:06:18,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:18" (1/1) ... [2024-11-16 17:06:18,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:18" (1/1) ... [2024-11-16 17:06:18,832 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-11-16 17:06:18,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:06:18,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:06:18,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:06:18,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:06:18,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:18" (1/1) ... [2024-11-16 17:06:18,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:18" (1/1) ... [2024-11-16 17:06:18,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:18" (1/1) ... [2024-11-16 17:06:18,877 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 17:06:18,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:18" (1/1) ... [2024-11-16 17:06:18,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:18" (1/1) ... [2024-11-16 17:06:18,901 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:18" (1/1) ... [2024-11-16 17:06:18,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:18" (1/1) ... [2024-11-16 17:06:18,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:18" (1/1) ... [2024-11-16 17:06:18,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:18" (1/1) ... [2024-11-16 17:06:18,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:06:18,925 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:06:18,925 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:06:18,925 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:06:18,926 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:18" (1/1) ... [2024-11-16 17:06:18,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:06:18,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:06:18,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 17:06:18,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 17:06:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:06:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 17:06:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:06:19,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:06:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:06:19,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:06:19,117 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:06:19,120 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:06:38,718 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-16 17:06:38,718 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:06:38,731 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:06:38,731 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:06:38,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:06:38 BoogieIcfgContainer [2024-11-16 17:06:38,733 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:06:38,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:06:38,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:06:38,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:06:38,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:06:18" (1/3) ... [2024-11-16 17:06:38,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773654f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:06:38, skipping insertion in model container [2024-11-16 17:06:38,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:06:18" (2/3) ... [2024-11-16 17:06:38,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773654f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:06:38, skipping insertion in model container [2024-11-16 17:06:38,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:06:38" (3/3) ... [2024-11-16 17:06:38,743 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-49.i [2024-11-16 17:06:38,759 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:06:38,759 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:06:38,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:06:38,827 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a8bfe4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:06:38,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:06:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 17:06:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 17:06:38,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:06:38,860 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:06:38,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:06:38,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:06:38,865 INFO L85 PathProgramCache]: Analyzing trace with hash 782010630, now seen corresponding path program 1 times [2024-11-16 17:06:38,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:06:38,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689135478] [2024-11-16 17:06:38,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:06:38,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:06:38,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:06:38,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:06:38,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 17:06:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:39,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 17:06:39,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:06:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-11-16 17:06:40,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:06:40,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:06:40,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689135478] [2024-11-16 17:06:40,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689135478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:06:40,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:06:40,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:06:40,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476554782] [2024-11-16 17:06:40,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:06:40,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:06:40,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:06:40,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:06:40,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:06:40,096 INFO L87 Difference]: Start difference. First operand has 89 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 17:06:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:06:40,123 INFO L93 Difference]: Finished difference Result 170 states and 293 transitions. [2024-11-16 17:06:40,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:06:40,126 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2024-11-16 17:06:40,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:06:40,133 INFO L225 Difference]: With dead ends: 170 [2024-11-16 17:06:40,133 INFO L226 Difference]: Without dead ends: 84 [2024-11-16 17:06:40,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:06:40,140 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:06:40,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:06:40,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-16 17:06:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-16 17:06:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 17:06:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2024-11-16 17:06:40,206 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 173 [2024-11-16 17:06:40,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:06:40,206 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2024-11-16 17:06:40,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 17:06:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2024-11-16 17:06:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 17:06:40,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:06:40,211 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:06:40,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 17:06:40,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:06:40,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:06:40,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:06:40,413 INFO L85 PathProgramCache]: Analyzing trace with hash 619811310, now seen corresponding path program 1 times [2024-11-16 17:06:40,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:06:40,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271285006] [2024-11-16 17:06:40,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:06:40,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:06:40,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:06:40,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:06:40,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 17:06:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:06:41,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 17:06:41,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:06:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 17:06:46,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:06:46,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:06:46,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271285006] [2024-11-16 17:06:46,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271285006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:06:46,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:06:46,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:06:46,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874025401] [2024-11-16 17:06:46,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:06:46,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:06:46,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:06:46,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:06:46,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:06:46,372 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 17:06:49,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:06:54,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:06:58,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:07:02,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:07:06,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:07:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:06,926 INFO L93 Difference]: Finished difference Result 246 states and 381 transitions. [2024-11-16 17:07:07,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:07:07,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-16 17:07:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:07,070 INFO L225 Difference]: With dead ends: 246 [2024-11-16 17:07:07,071 INFO L226 Difference]: Without dead ends: 165 [2024-11-16 17:07:07,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:07:07,078 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 45 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:07,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 362 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 4 Unknown, 0 Unchecked, 20.4s Time] [2024-11-16 17:07:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-16 17:07:07,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2024-11-16 17:07:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 107 states have internal predecessors, (148), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 17:07:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 252 transitions. [2024-11-16 17:07:07,127 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 252 transitions. Word has length 173 [2024-11-16 17:07:07,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:07,128 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 252 transitions. [2024-11-16 17:07:07,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 17:07:07,128 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 252 transitions. [2024-11-16 17:07:07,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 17:07:07,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:07,134 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:07:07,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 17:07:07,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:07:07,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:07,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:07,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2127363119, now seen corresponding path program 1 times [2024-11-16 17:07:07,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:07:07,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681997011] [2024-11-16 17:07:07,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:07,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:07:07,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:07:07,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:07:07,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 17:07:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:08,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 17:07:08,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:07:12,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 675 proven. 36 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-16 17:07:12,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:07:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 17:07:15,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:07:15,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681997011] [2024-11-16 17:07:15,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681997011] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 17:07:15,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 17:07:15,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-16 17:07:15,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379223703] [2024-11-16 17:07:15,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:15,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:07:15,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:07:15,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:07:15,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:07:15,108 INFO L87 Difference]: Start difference. First operand 162 states and 252 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 17:07:19,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:07:23,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:07:28,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []