./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-10.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 5eaef6984bac193e62a6065e1cf2471dce8c48b34819c0f610f9e55fe3174153 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:14:26,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:14:26,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 07:14:26,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:14:26,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:14:26,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:14:26,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:14:26,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:14:26,229 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:14:26,242 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:14:26,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:14:26,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:14:26,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:14:26,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:14:26,243 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:14:26,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:14:26,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:14:26,248 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:14:26,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 07:14:26,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:14:26,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:14:26,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:14:26,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:14:26,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:14:26,253 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:14:26,253 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:14:26,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:14:26,253 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:14:26,253 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:14:26,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:14:26,254 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:14:26,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:14:26,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:14:26,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:14:26,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:14:26,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:14:26,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 07:14:26,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 07:14:26,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:14:26,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:14:26,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:14:26,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:14:26,257 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 -> 5eaef6984bac193e62a6065e1cf2471dce8c48b34819c0f610f9e55fe3174153 [2024-11-20 07:14:26,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:14:26,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:14:26,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:14:26,506 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:14:26,507 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:14:26,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-10.i [2024-11-20 07:14:27,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:14:28,060 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:14:28,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-10.i [2024-11-20 07:14:28,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54d43aad5/e5521078b8b24ecc9e6dfc45c1117652/FLAG50c21f7c4 [2024-11-20 07:14:28,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54d43aad5/e5521078b8b24ecc9e6dfc45c1117652 [2024-11-20 07:14:28,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:14:28,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:14:28,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:14:28,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:14:28,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:14:28,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:14:28" (1/1) ... [2024-11-20 07:14:28,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e11c823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:28, skipping insertion in model container [2024-11-20 07:14:28,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:14:28" (1/1) ... [2024-11-20 07:14:28,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:14:28,595 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-10.i[916,929] [2024-11-20 07:14:28,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:14:28,694 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:14:28,704 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-10.i[916,929] [2024-11-20 07:14:28,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:14:28,780 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:14:28,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:28 WrapperNode [2024-11-20 07:14:28,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:14:28,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:14:28,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:14:28,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:14:28,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:28" (1/1) ... [2024-11-20 07:14:28,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:28" (1/1) ... [2024-11-20 07:14:28,852 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 291 [2024-11-20 07:14:28,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:14:28,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:14:28,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:14:28,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:14:28,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:28" (1/1) ... [2024-11-20 07:14:28,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:28" (1/1) ... [2024-11-20 07:14:28,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:28" (1/1) ... [2024-11-20 07:14:28,904 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-20 07:14:28,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:28" (1/1) ... [2024-11-20 07:14:28,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:28" (1/1) ... [2024-11-20 07:14:28,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:28" (1/1) ... [2024-11-20 07:14:28,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:28" (1/1) ... [2024-11-20 07:14:28,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:28" (1/1) ... [2024-11-20 07:14:28,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:28" (1/1) ... [2024-11-20 07:14:28,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:14:28,948 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:14:28,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:14:28,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:14:28,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:28" (1/1) ... [2024-11-20 07:14:28,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:14:28,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:14:28,984 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-20 07:14:29,020 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-20 07:14:29,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:14:29,085 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:14:29,086 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:14:29,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 07:14:29,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:14:29,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:14:29,150 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:14:29,156 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:14:29,600 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-20 07:14:29,600 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:14:29,616 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:14:29,616 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:14:29,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:14:29 BoogieIcfgContainer [2024-11-20 07:14:29,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:14:29,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:14:29,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:14:29,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:14:29,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:14:28" (1/3) ... [2024-11-20 07:14:29,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1ee824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:14:29, skipping insertion in model container [2024-11-20 07:14:29,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:14:28" (2/3) ... [2024-11-20 07:14:29,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1ee824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:14:29, skipping insertion in model container [2024-11-20 07:14:29,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:14:29" (3/3) ... [2024-11-20 07:14:29,624 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-10.i [2024-11-20 07:14:29,636 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:14:29,637 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:14:29,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:14:29,710 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;@1e5dd485, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:14:29,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:14:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 07:14:29,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 07:14:29,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:14:29,729 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:14:29,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:14:29,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:14:29,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1267482789, now seen corresponding path program 1 times [2024-11-20 07:14:29,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:14:29,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416131105] [2024-11-20 07:14:29,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:29,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:14:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:14:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:14:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:14:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:14:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:14:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:14:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:14:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:14:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:14:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 07:14:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 07:14:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:14:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 07:14:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:14:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 07:14:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 07:14:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 07:14:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:14:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:14:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:14:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 07:14:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:14:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 07:14:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 07:14:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 07:14:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 07:14:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 07:14:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 07:14:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 07:14:30,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:14:30,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416131105] [2024-11-20 07:14:30,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416131105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:14:30,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:14:30,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:14:30,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967477857] [2024-11-20 07:14:30,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:14:30,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:14:30,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:14:30,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:14:30,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:14:30,208 INFO L87 Difference]: Start difference. First operand has 124 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 07:14:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:14:30,236 INFO L93 Difference]: Finished difference Result 241 states and 406 transitions. [2024-11-20 07:14:30,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:14:30,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 192 [2024-11-20 07:14:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:14:30,246 INFO L225 Difference]: With dead ends: 241 [2024-11-20 07:14:30,248 INFO L226 Difference]: Without dead ends: 120 [2024-11-20 07:14:30,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-20 07:14:30,260 INFO L432 NwaCegarLoop]: 185 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, 185 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-20 07:14:30,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:14:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-20 07:14:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-20 07:14:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 07:14:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 185 transitions. [2024-11-20 07:14:30,312 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 185 transitions. Word has length 192 [2024-11-20 07:14:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:14:30,314 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 185 transitions. [2024-11-20 07:14:30,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 07:14:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 185 transitions. [2024-11-20 07:14:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 07:14:30,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:14:30,318 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:14:30,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 07:14:30,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:14:30,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:14:30,319 INFO L85 PathProgramCache]: Analyzing trace with hash -153519909, now seen corresponding path program 1 times [2024-11-20 07:14:30,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:14:30,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568002080] [2024-11-20 07:14:30,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:30,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:14:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:14:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:14:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:14:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:14:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:14:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:14:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:14:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:14:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:14:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 07:14:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 07:14:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:14:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 07:14:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:14:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 07:14:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 07:14:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 07:14:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:14:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:14:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:14:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 07:14:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:14:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 07:14:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 07:14:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 07:14:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 07:14:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 07:14:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 07:14:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:30,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 07:14:30,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:14:30,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568002080] [2024-11-20 07:14:30,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568002080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:14:30,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:14:30,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:14:30,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960443452] [2024-11-20 07:14:30,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:14:30,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:14:30,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:14:30,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:14:30,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:14:30,703 INFO L87 Difference]: Start difference. First operand 120 states and 185 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 07:14:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:14:30,788 INFO L93 Difference]: Finished difference Result 353 states and 547 transitions. [2024-11-20 07:14:30,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:14:30,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2024-11-20 07:14:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:14:30,792 INFO L225 Difference]: With dead ends: 353 [2024-11-20 07:14:30,792 INFO L226 Difference]: Without dead ends: 236 [2024-11-20 07:14:30,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:14:30,795 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 175 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:14:30,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 482 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:14:30,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-20 07:14:30,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 125. [2024-11-20 07:14:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 95 states have internal predecessors, (137), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 07:14:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 193 transitions. [2024-11-20 07:14:30,813 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 193 transitions. Word has length 192 [2024-11-20 07:14:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:14:30,815 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 193 transitions. [2024-11-20 07:14:30,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 07:14:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 193 transitions. [2024-11-20 07:14:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 07:14:30,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:14:30,818 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:14:30,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 07:14:30,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:14:30,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:14:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash 547544669, now seen corresponding path program 1 times [2024-11-20 07:14:30,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:14:30,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35739307] [2024-11-20 07:14:30,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:14:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:14:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:14:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:14:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:14:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:14:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:14:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:14:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:14:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:14:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 07:14:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 07:14:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:14:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 07:14:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:14:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 07:14:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 07:14:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 07:14:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:14:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:14:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:14:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 07:14:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:14:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 07:14:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 07:14:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 07:14:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 07:14:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 07:14:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 07:14:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 07:14:31,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:14:31,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35739307] [2024-11-20 07:14:31,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35739307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:14:31,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:14:31,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:14:31,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041224223] [2024-11-20 07:14:31,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:14:31,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:14:31,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:14:31,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:14:31,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:14:31,115 INFO L87 Difference]: Start difference. First operand 125 states and 193 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 07:14:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:14:31,138 INFO L93 Difference]: Finished difference Result 247 states and 383 transitions. [2024-11-20 07:14:31,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:14:31,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2024-11-20 07:14:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:14:31,142 INFO L225 Difference]: With dead ends: 247 [2024-11-20 07:14:31,142 INFO L226 Difference]: Without dead ends: 125 [2024-11-20 07:14:31,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:14:31,148 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:14:31,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 363 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:14:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-20 07:14:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-20 07:14:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 95 states have (on average 1.431578947368421) internal successors, (136), 95 states have internal predecessors, (136), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 07:14:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 192 transitions. [2024-11-20 07:14:31,166 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 192 transitions. Word has length 192 [2024-11-20 07:14:31,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:14:31,170 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 192 transitions. [2024-11-20 07:14:31,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 07:14:31,170 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 192 transitions. [2024-11-20 07:14:31,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 07:14:31,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:14:31,172 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:14:31,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 07:14:31,172 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:14:31,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:14:31,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1824194593, now seen corresponding path program 1 times [2024-11-20 07:14:31,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:14:31,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634250180] [2024-11-20 07:14:31,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:31,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:14:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:14:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:14:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:14:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:14:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:14:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:14:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:14:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:14:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:14:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 07:14:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 07:14:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:14:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 07:14:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:14:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 07:14:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 07:14:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 07:14:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:14:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:14:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:14:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 07:14:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:14:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 07:14:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 07:14:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 07:14:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 07:14:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 07:14:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 07:14:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 07:14:31,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:14:31,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634250180] [2024-11-20 07:14:31,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634250180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:14:31,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:14:31,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 07:14:31,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983141281] [2024-11-20 07:14:31,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:14:31,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 07:14:31,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:14:31,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 07:14:31,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 07:14:31,655 INFO L87 Difference]: Start difference. First operand 125 states and 192 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 07:14:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:14:31,869 INFO L93 Difference]: Finished difference Result 431 states and 666 transitions. [2024-11-20 07:14:31,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 07:14:31,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2024-11-20 07:14:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:14:31,874 INFO L225 Difference]: With dead ends: 431 [2024-11-20 07:14:31,874 INFO L226 Difference]: Without dead ends: 309 [2024-11-20 07:14:31,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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-20 07:14:31,877 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 308 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 07:14:31,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 501 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 07:14:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-20 07:14:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 284. [2024-11-20 07:14:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 225 states have (on average 1.4577777777777778) internal successors, (328), 225 states have internal predecessors, (328), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 07:14:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 440 transitions. [2024-11-20 07:14:31,921 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 440 transitions. Word has length 192 [2024-11-20 07:14:31,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:14:31,922 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 440 transitions. [2024-11-20 07:14:31,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 07:14:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 440 transitions. [2024-11-20 07:14:31,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-20 07:14:31,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:14:31,926 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:14:31,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 07:14:31,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:14:31,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:14:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1028900130, now seen corresponding path program 1 times [2024-11-20 07:14:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:14:31,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685112089] [2024-11-20 07:14:31,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:31,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:14:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:14:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:14:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:14:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:14:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:14:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:14:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:14:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:14:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:14:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 07:14:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 07:14:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:14:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 07:14:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:14:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 07:14:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 07:14:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 07:14:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:14:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:14:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:14:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 07:14:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:14:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 07:14:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 07:14:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 07:14:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 07:14:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 07:14:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 07:14:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 07:14:32,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:14:32,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685112089] [2024-11-20 07:14:32,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685112089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:14:32,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159050619] [2024-11-20 07:14:32,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:32,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:14:32,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:14:32,336 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-20 07:14:32,341 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-20 07:14:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:32,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 07:14:32,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:14:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 231 proven. 75 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2024-11-20 07:14:32,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:14:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 07:14:33,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159050619] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:14:33,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 07:14:33,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-20 07:14:33,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846009522] [2024-11-20 07:14:33,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 07:14:33,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 07:14:33,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:14:33,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 07:14:33,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:14:33,065 INFO L87 Difference]: Start difference. First operand 284 states and 440 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-11-20 07:14:33,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:14:33,298 INFO L93 Difference]: Finished difference Result 577 states and 887 transitions. [2024-11-20 07:14:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 07:14:33,303 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) Word has length 194 [2024-11-20 07:14:33,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:14:33,310 INFO L225 Difference]: With dead ends: 577 [2024-11-20 07:14:33,310 INFO L226 Difference]: Without dead ends: 296 [2024-11-20 07:14:33,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-20 07:14:33,313 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 294 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 07:14:33,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 376 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 07:14:33,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-20 07:14:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2024-11-20 07:14:33,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 231 states have (on average 1.406926406926407) internal successors, (325), 231 states have internal predecessors, (325), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 07:14:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 437 transitions. [2024-11-20 07:14:33,331 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 437 transitions. Word has length 194 [2024-11-20 07:14:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:14:33,331 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 437 transitions. [2024-11-20 07:14:33,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-11-20 07:14:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 437 transitions. [2024-11-20 07:14:33,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-20 07:14:33,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:14:33,333 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:14:33,346 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-20 07:14:33,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:14:33,534 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:14:33,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:14:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash 236091436, now seen corresponding path program 1 times [2024-11-20 07:14:33,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:14:33,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226932470] [2024-11-20 07:14:33,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:33,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:14:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 07:14:33,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2125455058] [2024-11-20 07:14:33,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:33,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:14:33,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:14:33,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 07:14:33,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 07:14:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:33,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-20 07:14:33,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:14:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 987 proven. 282 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-11-20 07:14:37,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:14:47,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:14:47,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226932470] [2024-11-20 07:14:47,142 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 07:14:47,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125455058] [2024-11-20 07:14:47,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125455058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:14:47,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 07:14:47,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2024-11-20 07:14:47,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047242677] [2024-11-20 07:14:47,142 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 07:14:47,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-20 07:14:47,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:14:47,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-20 07:14:47,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1080, Unknown=0, NotChecked=0, Total=1332 [2024-11-20 07:14:47,144 INFO L87 Difference]: Start difference. First operand 292 states and 437 transitions. Second operand has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 27 states have internal predecessors, (91), 8 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-20 07:14:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:14:48,547 INFO L93 Difference]: Finished difference Result 650 states and 943 transitions. [2024-11-20 07:14:48,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-20 07:14:48,548 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 27 states have internal predecessors, (91), 8 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) Word has length 195 [2024-11-20 07:14:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:14:48,550 INFO L225 Difference]: With dead ends: 650 [2024-11-20 07:14:48,550 INFO L226 Difference]: Without dead ends: 361 [2024-11-20 07:14:48,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=430, Invalid=1550, Unknown=0, NotChecked=0, Total=1980 [2024-11-20 07:14:48,552 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 243 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 07:14:48,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 2009 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 07:14:48,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-20 07:14:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 323. [2024-11-20 07:14:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 255 states have (on average 1.3686274509803922) internal successors, (349), 255 states have internal predecessors, (349), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 07:14:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 461 transitions. [2024-11-20 07:14:48,583 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 461 transitions. Word has length 195 [2024-11-20 07:14:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:14:48,584 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 461 transitions. [2024-11-20 07:14:48,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 27 states have internal predecessors, (91), 8 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-20 07:14:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 461 transitions. [2024-11-20 07:14:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-20 07:14:48,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:14:48,590 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:14:48,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 07:14:48,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 07:14:48,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:14:48,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:14:48,792 INFO L85 PathProgramCache]: Analyzing trace with hash 814890536, now seen corresponding path program 1 times [2024-11-20 07:14:48,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:14:48,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825177410] [2024-11-20 07:14:48,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:48,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:14:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:14:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:14:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:14:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:14:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:14:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:14:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:14:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:14:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:14:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 07:14:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 07:14:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:14:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 07:14:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:14:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 07:14:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 07:14:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 07:14:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:14:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:14:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:14:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 07:14:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:14:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 07:14:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 07:14:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 07:14:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 07:14:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 07:14:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 07:14:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 07:14:49,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:14:49,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825177410] [2024-11-20 07:14:49,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825177410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:14:49,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:14:49,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 07:14:49,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081017466] [2024-11-20 07:14:49,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:14:49,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 07:14:49,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:14:49,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 07:14:49,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 07:14:49,262 INFO L87 Difference]: Start difference. First operand 323 states and 461 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 07:14:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:14:49,497 INFO L93 Difference]: Finished difference Result 1083 states and 1520 transitions. [2024-11-20 07:14:49,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 07:14:49,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2024-11-20 07:14:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:14:49,501 INFO L225 Difference]: With dead ends: 1083 [2024-11-20 07:14:49,501 INFO L226 Difference]: Without dead ends: 763 [2024-11-20 07:14:49,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-20 07:14:49,502 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 206 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 07:14:49,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 548 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 07:14:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-11-20 07:14:49,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 554. [2024-11-20 07:14:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 427 states have (on average 1.3395784543325526) internal successors, (572), 429 states have internal predecessors, (572), 104 states have call successors, (104), 22 states have call predecessors, (104), 22 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-20 07:14:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 780 transitions. [2024-11-20 07:14:49,536 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 780 transitions. Word has length 195 [2024-11-20 07:14:49,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:14:49,537 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 780 transitions. [2024-11-20 07:14:49,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 07:14:49,537 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 780 transitions. [2024-11-20 07:14:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-20 07:14:49,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:14:49,538 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:14:49,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 07:14:49,539 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:14:49,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:14:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash -206177818, now seen corresponding path program 1 times [2024-11-20 07:14:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:14:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90074685] [2024-11-20 07:14:49,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:49,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:14:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 07:14:49,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [905358468] [2024-11-20 07:14:49,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:49,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:14:49,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:14:49,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 07:14:49,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 07:14:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:49,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-20 07:14:49,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:14:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 983 proven. 192 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-11-20 07:14:51,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:14:54,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:14:54,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90074685] [2024-11-20 07:14:54,120 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 07:14:54,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905358468] [2024-11-20 07:14:54,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905358468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:14:54,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 07:14:54,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2024-11-20 07:14:54,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194490079] [2024-11-20 07:14:54,121 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 07:14:54,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-20 07:14:54,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:14:54,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-20 07:14:54,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=748, Unknown=0, NotChecked=0, Total=930 [2024-11-20 07:14:54,122 INFO L87 Difference]: Start difference. First operand 554 states and 780 transitions. Second operand has 25 states, 25 states have (on average 3.28) internal successors, (82), 22 states have internal predecessors, (82), 6 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-20 07:14:55,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:14:55,313 INFO L93 Difference]: Finished difference Result 1297 states and 1832 transitions. [2024-11-20 07:14:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-20 07:14:55,314 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.28) internal successors, (82), 22 states have internal predecessors, (82), 6 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 195 [2024-11-20 07:14:55,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:14:55,319 INFO L225 Difference]: With dead ends: 1297 [2024-11-20 07:14:55,320 INFO L226 Difference]: Without dead ends: 1072 [2024-11-20 07:14:55,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2024-11-20 07:14:55,321 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 239 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 07:14:55,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1500 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 07:14:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-20 07:14:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 615. [2024-11-20 07:14:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 484 states have (on average 1.365702479338843) internal successors, (661), 485 states have internal predecessors, (661), 108 states have call successors, (108), 22 states have call predecessors, (108), 22 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-20 07:14:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 877 transitions. [2024-11-20 07:14:55,357 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 877 transitions. Word has length 195 [2024-11-20 07:14:55,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:14:55,357 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 877 transitions. [2024-11-20 07:14:55,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.28) internal successors, (82), 22 states have internal predecessors, (82), 6 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2024-11-20 07:14:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 877 transitions. [2024-11-20 07:14:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-20 07:14:55,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:14:55,359 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:14:55,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 07:14:55,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:14:55,560 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:14:55,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:14:55,561 INFO L85 PathProgramCache]: Analyzing trace with hash 494886760, now seen corresponding path program 1 times [2024-11-20 07:14:55,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:14:55,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863553644] [2024-11-20 07:14:55,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:55,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:14:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:14:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:14:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:14:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:14:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:14:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:14:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:14:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:14:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:14:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 07:14:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 07:14:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:14:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 07:14:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:14:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 07:14:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 07:14:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 07:14:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:14:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:14:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:14:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 07:14:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:14:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 07:14:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 07:14:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 07:14:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 07:14:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 07:14:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 07:14:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 07:14:55,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:14:55,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863553644] [2024-11-20 07:14:55,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863553644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:14:55,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:14:55,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:14:55,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31662272] [2024-11-20 07:14:55,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:14:55,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:14:55,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:14:55,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:14:55,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:14:55,662 INFO L87 Difference]: Start difference. First operand 615 states and 877 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 07:14:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:14:55,728 INFO L93 Difference]: Finished difference Result 1711 states and 2436 transitions. [2024-11-20 07:14:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:14:55,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2024-11-20 07:14:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:14:55,734 INFO L225 Difference]: With dead ends: 1711 [2024-11-20 07:14:55,734 INFO L226 Difference]: Without dead ends: 1099 [2024-11-20 07:14:55,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:14:55,736 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 172 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:14:55,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 395 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:14:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2024-11-20 07:14:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 612. [2024-11-20 07:14:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 481 states have (on average 1.3326403326403327) internal successors, (641), 482 states have internal predecessors, (641), 108 states have call successors, (108), 22 states have call predecessors, (108), 22 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-20 07:14:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 857 transitions. [2024-11-20 07:14:55,783 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 857 transitions. Word has length 195 [2024-11-20 07:14:55,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:14:55,785 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 857 transitions. [2024-11-20 07:14:55,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 07:14:55,786 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 857 transitions. [2024-11-20 07:14:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-20 07:14:55,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:14:55,788 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:14:55,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 07:14:55,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:14:55,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:14:55,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1908506087, now seen corresponding path program 1 times [2024-11-20 07:14:55,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:14:55,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660478030] [2024-11-20 07:14:55,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:55,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:14:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:14:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:14:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:14:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:14:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:14:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:14:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:14:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:14:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:14:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 07:14:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 07:14:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 07:14:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 07:14:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:14:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 07:14:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 07:14:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 07:14:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:14:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:14:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:14:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 07:14:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:14:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 07:14:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 07:14:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 07:14:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 07:14:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 07:14:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 07:14:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 07:14:56,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:14:56,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660478030] [2024-11-20 07:14:56,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660478030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:14:56,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709612434] [2024-11-20 07:14:56,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:56,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:14:56,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:14:56,112 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 07:14:56,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 07:14:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:14:56,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 07:14:56,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:14:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-11-20 07:14:56,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:14:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 07:14:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709612434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:14:56,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 07:14:56,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-20 07:14:56,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060384242] [2024-11-20 07:14:56,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 07:14:56,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 07:14:56,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:14:56,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 07:14:56,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 07:14:56,444 INFO L87 Difference]: Start difference. First operand 612 states and 857 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-20 07:14:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:14:56,854 INFO L93 Difference]: Finished difference Result 1486 states and 2040 transitions. [2024-11-20 07:14:56,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 07:14:56,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 196 [2024-11-20 07:14:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:14:56,860 INFO L225 Difference]: With dead ends: 1486 [2024-11-20 07:14:56,860 INFO L226 Difference]: Without dead ends: 877 [2024-11-20 07:14:56,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 446 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2024-11-20 07:14:56,862 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 356 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 07:14:56,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 485 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 07:14:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2024-11-20 07:14:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 624. [2024-11-20 07:14:56,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 490 states have (on average 1.3122448979591836) internal successors, (643), 491 states have internal predecessors, (643), 108 states have call successors, (108), 25 states have call predecessors, (108), 25 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-20 07:14:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 859 transitions. [2024-11-20 07:14:56,903 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 859 transitions. Word has length 196 [2024-11-20 07:14:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:14:56,903 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 859 transitions. [2024-11-20 07:14:56,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-20 07:14:56,903 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 859 transitions. [2024-11-20 07:14:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-20 07:14:56,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:14:56,904 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:14:56,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 07:14:57,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:14:57,109 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:14:57,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:14:57,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1706402839, now seen corresponding path program 1 times [2024-11-20 07:14:57,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:14:57,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517820857] [2024-11-20 07:14:57,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:57,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:14:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 07:14:57,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2050383230] [2024-11-20 07:14:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:14:57,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:14:57,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:14:57,238 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 07:14:57,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 07:14:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:14:57,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 07:14:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:14:57,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 07:14:57,527 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 07:14:57,528 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:14:57,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 07:14:57,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-20 07:14:57,737 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:14:57,882 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:14:57,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:14:57 BoogieIcfgContainer [2024-11-20 07:14:57,884 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:14:57,885 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:14:57,885 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:14:57,885 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:14:57,885 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:14:29" (3/4) ... [2024-11-20 07:14:57,887 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 07:14:57,888 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:14:57,888 INFO L158 Benchmark]: Toolchain (without parser) took 29446.14ms. Allocated memory was 241.2MB in the beginning and 633.3MB in the end (delta: 392.2MB). Free memory was 172.6MB in the beginning and 518.3MB in the end (delta: -345.7MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2024-11-20 07:14:57,888 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 123.7MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:14:57,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.41ms. Allocated memory is still 241.2MB. Free memory was 172.3MB in the beginning and 153.8MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 07:14:57,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.00ms. Allocated memory is still 241.2MB. Free memory was 153.8MB in the beginning and 147.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 07:14:57,889 INFO L158 Benchmark]: Boogie Preprocessor took 94.03ms. Allocated memory is still 241.2MB. Free memory was 147.2MB in the beginning and 137.7MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 07:14:57,889 INFO L158 Benchmark]: RCFGBuilder took 668.11ms. Allocated memory is still 241.2MB. Free memory was 137.7MB in the beginning and 172.0MB in the end (delta: -34.3MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-11-20 07:14:57,890 INFO L158 Benchmark]: TraceAbstraction took 28266.28ms. Allocated memory was 241.2MB in the beginning and 633.3MB in the end (delta: 392.2MB). Free memory was 170.9MB in the beginning and 518.3MB in the end (delta: -347.4MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-11-20 07:14:57,890 INFO L158 Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 633.3MB. Free memory is still 518.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:14:57,891 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.12ms. Allocated memory is still 123.7MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.41ms. Allocated memory is still 241.2MB. Free memory was 172.3MB in the beginning and 153.8MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.00ms. Allocated memory is still 241.2MB. Free memory was 153.8MB in the beginning and 147.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.03ms. Allocated memory is still 241.2MB. Free memory was 147.2MB in the beginning and 137.7MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 668.11ms. Allocated memory is still 241.2MB. Free memory was 137.7MB in the beginning and 172.0MB in the end (delta: -34.3MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * TraceAbstraction took 28266.28ms. Allocated memory was 241.2MB in the beginning and 633.3MB in the end (delta: 392.2MB). Free memory was 170.9MB in the beginning and 518.3MB in the end (delta: -347.4MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * Witness Printer took 3.38ms. Allocated memory is still 633.3MB. Free memory is still 518.3MB. There was no memory consumed. 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 200, overapproximation of bitwiseOr at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_7 = 10000; [L24] unsigned short int var_1_8 = 20453; [L25] signed short int var_1_10 = -5; [L26] unsigned char var_1_12 = 5; [L27] unsigned short int var_1_13 = 63501; [L28] unsigned char var_1_14 = 1; [L29] float var_1_15 = 16.25; [L30] float var_1_16 = 5.13; [L31] float var_1_17 = 99999999.25; [L32] signed char var_1_18 = 0; [L33] signed char var_1_19 = -4; [L34] signed char var_1_20 = 16; [L35] signed char var_1_21 = -100; [L36] float var_1_22 = 31.4; [L37] float var_1_23 = 16.432; [L38] float var_1_24 = 9999.5; [L39] unsigned long int var_1_26 = 100000000; [L40] unsigned short int var_1_27 = 50; [L41] float var_1_28 = 255.5; [L42] unsigned short int var_1_29 = 16; [L43] unsigned short int var_1_30 = 21823; [L44] float var_1_31 = 3.325; [L45] signed long int var_1_33 = 8; [L46] signed short int var_1_35 = -1; [L47] signed short int var_1_36 = 32549; [L48] unsigned char var_1_37 = 1; [L49] unsigned char var_1_38 = 0; [L50] unsigned char var_1_39 = 0; [L51] unsigned char var_1_40 = 128; [L52] unsigned char var_1_41 = 0; [L53] unsigned char last_1_var_1_12 = 5; [L54] unsigned long int last_1_var_1_26 = 100000000; [L55] signed short int last_1_var_1_35 = -1; VAL [isInitial=0, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=10000, var_1_8=20453] [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L195] last_1_var_1_12 = var_1_12 [L196] last_1_var_1_26 = var_1_26 [L197] last_1_var_1_35 = var_1_35 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=10000, var_1_8=20453] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L149] var_1_7 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_7 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=20453] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=20453] [L150] RET assume_abort_if_not(var_1_7 >= 8191) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=20453] [L151] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=20453] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=20453] [L151] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=20453] [L152] var_1_8 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L153] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L154] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L154] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=63501, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L155] var_1_13 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_13 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L156] RET assume_abort_if_not(var_1_13 >= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L157] CALL assume_abort_if_not(var_1_13 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L157] RET assume_abort_if_not(var_1_13 <= 65535) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=1, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L159] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L160] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L160] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_16=513/100, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L161] var_1_16 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L162] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_17=399999997/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L163] var_1_17 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L164] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-4, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L165] var_1_19 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L166] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L167] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L167] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=16, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L168] var_1_20 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_20 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L169] RET assume_abort_if_not(var_1_20 >= -127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L170] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L170] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-100, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L171] var_1_21 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L172] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L173] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L173] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_23=2054/125, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L174] var_1_23 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_23 >= -461168.6018427382800e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L175] RET assume_abort_if_not((var_1_23 >= -461168.6018427382800e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_24=19999/2, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L176] var_1_24 = __VERIFIER_nondet_float() [L177] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L177] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_28=511/2, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L178] var_1_28 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L179] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L180] CALL assume_abort_if_not(var_1_28 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L180] RET assume_abort_if_not(var_1_28 != 0.0F) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=21823, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L181] var_1_30 = __VERIFIER_nondet_ushort() [L182] CALL assume_abort_if_not(var_1_30 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L182] RET assume_abort_if_not(var_1_30 >= 16384) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L183] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L183] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=32549, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L184] var_1_36 = __VERIFIER_nondet_short() [L185] CALL assume_abort_if_not(var_1_36 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L185] RET assume_abort_if_not(var_1_36 >= 16383) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L186] CALL assume_abort_if_not(var_1_36 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L186] RET assume_abort_if_not(var_1_36 <= 32766) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L187] var_1_38 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L188] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L189] CALL assume_abort_if_not(var_1_38 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L189] RET assume_abort_if_not(var_1_38 <= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=0, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L190] var_1_39 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_39 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L191] RET assume_abort_if_not(var_1_39 >= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L192] CALL assume_abort_if_not(var_1_39 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L192] RET assume_abort_if_not(var_1_39 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L208] RET updateVariables() [L209] CALL step() [L59] EXPR last_1_var_1_12 | last_1_var_1_35 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=50, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L59] signed long int stepLocal_5 = last_1_var_1_12 | last_1_var_1_35; [L60] COND TRUE var_1_16 >= (var_1_17 / var_1_28) [L61] var_1_27 = (last_1_var_1_26 + var_1_14) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000003, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L67] signed long int stepLocal_2 = 4 + var_1_13; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_2=32771, stepLocal_5=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000003, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L68] COND FALSE !((16 / -5) >= stepLocal_2) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=-5, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000003, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=128, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L71] var_1_40 = var_1_14 [L72] var_1_10 = (var_1_40 - var_1_40) [L73] unsigned char stepLocal_1 = var_1_40; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_1=3, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000003, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L74] COND FALSE !(stepLocal_1 >= 4) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000003, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L81] COND FALSE !(var_1_8 <= var_1_40) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000003, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L84] unsigned short int stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_4=-32769, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=100000000, var_1_27=100000003, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L85] COND TRUE stepLocal_4 >= var_1_40 [L86] var_1_26 = var_1_7 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000003, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L88] unsigned long int stepLocal_0 = var_1_26; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_0=8191, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=0, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000003, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L89] COND FALSE !(stepLocal_0 <= 32) [L94] var_1_1 = ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000003, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=8, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L96] COND TRUE var_1_24 < var_1_16 [L97] var_1_33 = (var_1_30 + ((var_1_1 + var_1_27) - 10)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000003, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L99] unsigned short int stepLocal_10 = var_1_8; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-32769, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000003, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L100] COND FALSE !(var_1_15 > (var_1_23 / var_1_28)) [L107] var_1_41 = var_1_38 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-32769, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000003, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L109] signed short int stepLocal_9 = var_1_36; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-32769, stepLocal_5=-1, stepLocal_9=16383, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000003, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L110] COND TRUE stepLocal_9 <= var_1_30 [L111] var_1_37 = ((! var_1_41) && var_1_38) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-32769, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000003, var_1_29=16, var_1_30=16384, var_1_31=133/40, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L115] COND FALSE !(\read(var_1_37)) [L118] var_1_29 = ((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) + var_1_30) - var_1_40) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-32769, stepLocal_5=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000003, var_1_29=49148, var_1_30=16384, var_1_31=133/40, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L120] unsigned char stepLocal_8 = var_1_37; [L121] unsigned short int stepLocal_7 = var_1_13; [L122] signed long int stepLocal_6 = - var_1_40; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-32769, stepLocal_5=-1, stepLocal_6=-3, stepLocal_7=32767, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000003, var_1_29=49148, var_1_30=16384, var_1_31=133/40, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L123] COND TRUE (var_1_40 / var_1_8) <= stepLocal_7 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-32769, stepLocal_5=-1, stepLocal_6=-3, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000003, var_1_29=49148, var_1_30=16384, var_1_31=133/40, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L124] COND FALSE !(var_1_14 == stepLocal_6) [L129] var_1_31 = var_1_17 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-32769, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000003, var_1_29=49148, var_1_30=16384, var_1_31=2, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L134] COND FALSE !(\read(var_1_37)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-32769, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000003, var_1_29=49148, var_1_30=16384, var_1_31=2, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L137] signed long int stepLocal_3 = (var_1_7 * var_1_12) * (var_1_29 * var_1_12); VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-32769, stepLocal_3=10064281700, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000003, var_1_29=49148, var_1_30=16384, var_1_31=2, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L138] COND FALSE !(stepLocal_3 == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-32769, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=157/5, var_1_26=8191, var_1_27=100000003, var_1_29=49148, var_1_30=16384, var_1_31=2, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L141] COND FALSE !(\read(var_1_41)) [L144] var_1_22 = var_1_24 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, stepLocal_10=-32769, stepLocal_5=-1, stepLocal_8=0, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000003, var_1_29=49148, var_1_30=16384, var_1_31=2, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L209] RET step() [L210] CALL, EXPR property() [L200] EXPR ((((((((var_1_26 <= 32) ? ((var_1_15 < var_1_15) ? (var_1_1 == ((unsigned short int) (var_1_26 + var_1_12))) : 1) : (var_1_1 == ((unsigned short int) ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12))))) && (var_1_10 == ((signed short int) (var_1_40 - var_1_40)))) && ((var_1_40 >= 4) ? ((! ((var_1_13 - var_1_40) <= 64)) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) var_1_14))) : 1)) && ((var_1_8 <= var_1_40) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1)) && (((16 / -5) >= (4 + var_1_13)) ? (var_1_18 == ((signed char) ((((var_1_19) > (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))) ? (var_1_19) : (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) : 1)) && ((((var_1_7 * var_1_12) * (var_1_29 * var_1_12)) == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) ? (var_1_22 == ((float) (var_1_23 + var_1_24))) : (var_1_41 ? (var_1_22 == ((float) var_1_17)) : (var_1_22 == ((float) var_1_24))))) && ((var_1_8 >= var_1_40) ? (var_1_26 == ((unsigned long int) var_1_7)) : 1)) && ((var_1_16 >= (var_1_17 / var_1_28)) ? (var_1_27 == ((unsigned short int) (last_1_var_1_26 + var_1_14))) : (((last_1_var_1_12 | last_1_var_1_35) < var_1_7) ? (var_1_27 == ((unsigned short int) last_1_var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000003, var_1_29=49148, var_1_30=16384, var_1_31=2, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L200] EXPR (((((((((((((((var_1_26 <= 32) ? ((var_1_15 < var_1_15) ? (var_1_1 == ((unsigned short int) (var_1_26 + var_1_12))) : 1) : (var_1_1 == ((unsigned short int) ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12))))) && (var_1_10 == ((signed short int) (var_1_40 - var_1_40)))) && ((var_1_40 >= 4) ? ((! ((var_1_13 - var_1_40) <= 64)) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) var_1_14))) : 1)) && ((var_1_8 <= var_1_40) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1)) && (((16 / -5) >= (4 + var_1_13)) ? (var_1_18 == ((signed char) ((((var_1_19) > (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))) ? (var_1_19) : (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) : 1)) && ((((var_1_7 * var_1_12) * (var_1_29 * var_1_12)) == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) ? (var_1_22 == ((float) (var_1_23 + var_1_24))) : (var_1_41 ? (var_1_22 == ((float) var_1_17)) : (var_1_22 == ((float) var_1_24))))) && ((var_1_8 >= var_1_40) ? (var_1_26 == ((unsigned long int) var_1_7)) : 1)) && ((var_1_16 >= (var_1_17 / var_1_28)) ? (var_1_27 == ((unsigned short int) (last_1_var_1_26 + var_1_14))) : (((last_1_var_1_12 | last_1_var_1_35) < var_1_7) ? (var_1_27 == ((unsigned short int) last_1_var_1_12)) : 1))) && (var_1_37 ? (var_1_29 == ((unsigned short int) ((((16) > ((var_1_12 + var_1_7))) ? (16) : ((var_1_12 + var_1_7)))))) : (var_1_29 == ((unsigned short int) ((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) + var_1_30) - var_1_40))))) && (((var_1_40 / var_1_8) <= var_1_13) ? ((var_1_14 == (- var_1_40)) ? ((var_1_37 || var_1_37) ? (var_1_31 == ((float) var_1_24)) : 1) : (var_1_31 == ((float) var_1_17))) : (var_1_31 == ((float) var_1_16)))) && ((var_1_24 < var_1_16) ? (var_1_33 == ((signed long int) (var_1_30 + ((var_1_1 + var_1_27) - 10)))) : 1)) && (var_1_37 ? (var_1_35 == ((signed short int) (var_1_12 - (var_1_36 - var_1_12)))) : 1)) && ((var_1_36 <= var_1_30) ? (var_1_37 == ((unsigned char) ((! var_1_41) && var_1_38))) : (var_1_37 == ((unsigned char) (var_1_41 || var_1_39))))) && (var_1_40 == ((unsigned char) var_1_14))) && ((var_1_15 > (var_1_23 / var_1_28)) ? (((((((var_1_33 | var_1_14)) > (var_1_36)) ? ((var_1_33 | var_1_14)) : (var_1_36))) <= var_1_8) ? (var_1_41 == ((unsigned char) 0)) : (var_1_41 == ((unsigned char) 0))) : (var_1_41 == ((unsigned char) var_1_38))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000003, var_1_29=49148, var_1_30=16384, var_1_31=2, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L200-L201] return (((((((((((((((var_1_26 <= 32) ? ((var_1_15 < var_1_15) ? (var_1_1 == ((unsigned short int) (var_1_26 + var_1_12))) : 1) : (var_1_1 == ((unsigned short int) ((var_1_12 + (var_1_7 - var_1_26)) + (var_1_8 - var_1_12))))) && (var_1_10 == ((signed short int) (var_1_40 - var_1_40)))) && ((var_1_40 >= 4) ? ((! ((var_1_13 - var_1_40) <= 64)) ? (var_1_12 == ((unsigned char) var_1_14)) : (var_1_12 == ((unsigned char) var_1_14))) : 1)) && ((var_1_8 <= var_1_40) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1)) && (((16 / -5) >= (4 + var_1_13)) ? (var_1_18 == ((signed char) ((((var_1_19) > (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))))) ? (var_1_19) : (((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))))) : 1)) && ((((var_1_7 * var_1_12) * (var_1_29 * var_1_12)) == (((((var_1_21) > (var_1_20)) ? (var_1_21) : (var_1_20))) + var_1_35)) ? (var_1_22 == ((float) (var_1_23 + var_1_24))) : (var_1_41 ? (var_1_22 == ((float) var_1_17)) : (var_1_22 == ((float) var_1_24))))) && ((var_1_8 >= var_1_40) ? (var_1_26 == ((unsigned long int) var_1_7)) : 1)) && ((var_1_16 >= (var_1_17 / var_1_28)) ? (var_1_27 == ((unsigned short int) (last_1_var_1_26 + var_1_14))) : (((last_1_var_1_12 | last_1_var_1_35) < var_1_7) ? (var_1_27 == ((unsigned short int) last_1_var_1_12)) : 1))) && (var_1_37 ? (var_1_29 == ((unsigned short int) ((((16) > ((var_1_12 + var_1_7))) ? (16) : ((var_1_12 + var_1_7)))))) : (var_1_29 == ((unsigned short int) ((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) + var_1_30) - var_1_40))))) && (((var_1_40 / var_1_8) <= var_1_13) ? ((var_1_14 == (- var_1_40)) ? ((var_1_37 || var_1_37) ? (var_1_31 == ((float) var_1_24)) : 1) : (var_1_31 == ((float) var_1_17))) : (var_1_31 == ((float) var_1_16)))) && ((var_1_24 < var_1_16) ? (var_1_33 == ((signed long int) (var_1_30 + ((var_1_1 + var_1_27) - 10)))) : 1)) && (var_1_37 ? (var_1_35 == ((signed short int) (var_1_12 - (var_1_36 - var_1_12)))) : 1)) && ((var_1_36 <= var_1_30) ? (var_1_37 == ((unsigned char) ((! var_1_41) && var_1_38))) : (var_1_37 == ((unsigned char) (var_1_41 || var_1_39))))) && (var_1_40 == ((unsigned char) var_1_14))) && ((var_1_15 > (var_1_23 / var_1_28)) ? (((((((var_1_33 | var_1_14)) > (var_1_36)) ? ((var_1_33 | var_1_14)) : (var_1_36))) <= var_1_8) ? (var_1_41 == ((unsigned char) 0)) : (var_1_41 == ((unsigned char) 0))) : (var_1_41 == ((unsigned char) var_1_38))) ; [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000003, var_1_29=49148, var_1_30=16384, var_1_31=2, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_26=100000000, last_1_var_1_35=-1, var_1_10=0, var_1_12=5, var_1_13=32767, var_1_14=3, var_1_15=65/4, var_1_17=2, var_1_18=0, var_1_19=-127, var_1_1=32767, var_1_20=0, var_1_21=-127, var_1_22=3, var_1_24=3, var_1_26=8191, var_1_27=100000003, var_1_29=49148, var_1_30=16384, var_1_31=2, var_1_33=106744, var_1_35=-1, var_1_36=16383, var_1_37=0, var_1_38=0, var_1_39=1, var_1_40=3, var_1_41=0, var_1_7=139263, var_1_8=-32769] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.1s, OverallIterations: 11, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1997 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1993 mSDsluCounter, 6844 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4838 mSDsCounter, 388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2946 IncrementalHoareTripleChecker+Invalid, 3334 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 388 mSolverCounterUnsat, 2006 mSDtfsCounter, 2946 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1780 GetRequests, 1662 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=624occurred in iteration=10, InterpolantAutomatonStates: 100, 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, 10 MinimizatonAttempts, 1584 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 3110 NumberOfCodeBlocks, 3110 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2704 ConstructedInterpolants, 3 QuantifiedInterpolants, 14035 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1831 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 20451/21168 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-20 07:14:57,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-10.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 5eaef6984bac193e62a6065e1cf2471dce8c48b34819c0f610f9e55fe3174153 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:15:00,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:15:00,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 07:15:00,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:15:00,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:15:00,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:15:00,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:15:00,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:15:00,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:15:00,255 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:15:00,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:15:00,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:15:00,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:15:00,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:15:00,257 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:15:00,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:15:00,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:15:00,258 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:15:00,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:15:00,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:15:00,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:15:00,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:15:00,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:15:00,263 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 07:15:00,263 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 07:15:00,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:15:00,265 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 07:15:00,266 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:15:00,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:15:00,266 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:15:00,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:15:00,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:15:00,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:15:00,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:15:00,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:15:00,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:15:00,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:15:00,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:15:00,268 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 07:15:00,268 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 07:15:00,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:15:00,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:15:00,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:15:00,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:15:00,269 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 -> 5eaef6984bac193e62a6065e1cf2471dce8c48b34819c0f610f9e55fe3174153 [2024-11-20 07:15:00,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:15:00,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:15:00,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:15:00,577 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:15:00,579 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:15:00,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-10.i [2024-11-20 07:15:02,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:15:02,267 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:15:02,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-10.i [2024-11-20 07:15:02,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82fd1a809/17caa05d737c4f76bd6d2b85fe40d77d/FLAGbd1b2df6d [2024-11-20 07:15:02,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82fd1a809/17caa05d737c4f76bd6d2b85fe40d77d [2024-11-20 07:15:02,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:15:02,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:15:02,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:15:02,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:15:02,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:15:02,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:15:02" (1/1) ... [2024-11-20 07:15:02,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d9921a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:02, skipping insertion in model container [2024-11-20 07:15:02,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:15:02" (1/1) ... [2024-11-20 07:15:02,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:15:02,492 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-10.i[916,929] [2024-11-20 07:15:02,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:15:02,568 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:15:02,577 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-10.i[916,929] [2024-11-20 07:15:02,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:15:02,631 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:15:02,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:02 WrapperNode [2024-11-20 07:15:02,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:15:02,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:15:02,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:15:02,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:15:02,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:02" (1/1) ... [2024-11-20 07:15:02,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:02" (1/1) ... [2024-11-20 07:15:02,704 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-20 07:15:02,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:15:02,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:15:02,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:15:02,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:15:02,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:02" (1/1) ... [2024-11-20 07:15:02,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:02" (1/1) ... [2024-11-20 07:15:02,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:02" (1/1) ... [2024-11-20 07:15:02,738 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-20 07:15:02,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:02" (1/1) ... [2024-11-20 07:15:02,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:02" (1/1) ... [2024-11-20 07:15:02,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:02" (1/1) ... [2024-11-20 07:15:02,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:02" (1/1) ... [2024-11-20 07:15:02,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:02" (1/1) ... [2024-11-20 07:15:02,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:02" (1/1) ... [2024-11-20 07:15:02,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:15:02,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:15:02,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:15:02,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:15:02,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:02" (1/1) ... [2024-11-20 07:15:02,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:15:02,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:15:02,790 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-20 07:15:02,794 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-20 07:15:02,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:15:02,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 07:15:02,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:15:02,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:15:02,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:15:02,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:15:02,913 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:15:02,916 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:15:08,495 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-20 07:15:08,496 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:15:08,513 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:15:08,517 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:15:08,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:15:08 BoogieIcfgContainer [2024-11-20 07:15:08,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:15:08,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:15:08,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:15:08,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:15:08,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:15:02" (1/3) ... [2024-11-20 07:15:08,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60814726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:15:08, skipping insertion in model container [2024-11-20 07:15:08,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:02" (2/3) ... [2024-11-20 07:15:08,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60814726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:15:08, skipping insertion in model container [2024-11-20 07:15:08,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:15:08" (3/3) ... [2024-11-20 07:15:08,533 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-10.i [2024-11-20 07:15:08,554 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:15:08,555 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:15:08,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:15:08,659 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;@2d544c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:15:08,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:15:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 07:15:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-20 07:15:08,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:15:08,682 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:15:08,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:15:08,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:15:08,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1130802316, now seen corresponding path program 1 times [2024-11-20 07:15:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:15:08,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581245282] [2024-11-20 07:15:08,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:15:08,700 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-20 07:15:08,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:15:08,703 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-20 07:15:08,704 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-20 07:15:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:15:09,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 07:15:09,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:15:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-20 07:15:09,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:15:09,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:15:09,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581245282] [2024-11-20 07:15:09,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581245282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:15:09,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:15:09,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:15:09,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631766796] [2024-11-20 07:15:09,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:15:09,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:15:09,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:15:09,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:15:09,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:15:09,384 INFO L87 Difference]: Start difference. First operand has 91 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 07:15:09,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:15:09,413 INFO L93 Difference]: Finished difference Result 175 states and 304 transitions. [2024-11-20 07:15:09,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:15:09,415 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2024-11-20 07:15:09,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:15:09,421 INFO L225 Difference]: With dead ends: 175 [2024-11-20 07:15:09,421 INFO L226 Difference]: Without dead ends: 87 [2024-11-20 07:15:09,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 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-20 07:15:09,426 INFO L432 NwaCegarLoop]: 133 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, 133 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-20 07:15:09,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:15:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-20 07:15:09,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-20 07:15:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 07:15:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2024-11-20 07:15:09,486 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 186 [2024-11-20 07:15:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:15:09,487 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2024-11-20 07:15:09,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 07:15:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2024-11-20 07:15:09,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-20 07:15:09,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:15:09,490 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:15:09,508 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-20 07:15:09,694 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-20 07:15:09,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:15:09,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:15:09,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1177038068, now seen corresponding path program 1 times [2024-11-20 07:15:09,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:15:09,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491653960] [2024-11-20 07:15:09,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:15:09,698 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-20 07:15:09,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:15:09,702 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-20 07:15:09,703 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-20 07:15:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:15:10,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 07:15:10,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:15:10,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 07:15:10,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:15:10,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:15:10,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491653960] [2024-11-20 07:15:10,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491653960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:15:10,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:15:10,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:15:10,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860444057] [2024-11-20 07:15:10,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:15:10,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:15:10,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:15:10,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:15:10,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:15:10,365 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 07:15:14,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-20 07:15:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:15:14,530 INFO L93 Difference]: Finished difference Result 171 states and 263 transitions. [2024-11-20 07:15:14,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:15:14,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-20 07:15:14,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:15:14,575 INFO L225 Difference]: With dead ends: 171 [2024-11-20 07:15:14,575 INFO L226 Difference]: Without dead ends: 87 [2024-11-20 07:15:14,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:15:14,577 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-20 07:15:14,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-11-20 07:15:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-20 07:15:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-20 07:15:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 07:15:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 132 transitions. [2024-11-20 07:15:14,587 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 132 transitions. Word has length 186 [2024-11-20 07:15:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:15:14,588 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 132 transitions. [2024-11-20 07:15:14,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 07:15:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 132 transitions. [2024-11-20 07:15:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-20 07:15:14,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:15:14,591 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:15:14,611 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-20 07:15:14,791 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-20 07:15:14,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:15:14,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:15:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash -628400266, now seen corresponding path program 1 times [2024-11-20 07:15:14,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:15:14,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890592384] [2024-11-20 07:15:14,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:15:14,795 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-20 07:15:14,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:15:14,796 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-20 07:15:14,799 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-20 07:15:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:15:15,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 07:15:15,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:15:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-11-20 07:15:15,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:15:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 07:15:17,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:15:17,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890592384] [2024-11-20 07:15:17,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890592384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:15:17,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 07:15:17,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-20 07:15:17,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346548917] [2024-11-20 07:15:17,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 07:15:17,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 07:15:17,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:15:17,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 07:15:17,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:15:17,289 INFO L87 Difference]: Start difference. First operand 87 states and 132 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-20 07:15:24,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 07:15:28,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 07:15:31,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 07:15:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:15:33,640 INFO L93 Difference]: Finished difference Result 271 states and 404 transitions. [2024-11-20 07:15:33,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 07:15:33,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 186 [2024-11-20 07:15:33,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:15:33,646 INFO L225 Difference]: With dead ends: 271 [2024-11-20 07:15:33,646 INFO L226 Difference]: Without dead ends: 187 [2024-11-20 07:15:33,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-20 07:15:33,655 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 251 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 110 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2024-11-20 07:15:33,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 486 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 371 Invalid, 2 Unknown, 0 Unchecked, 15.6s Time] [2024-11-20 07:15:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-20 07:15:33,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 97. [2024-11-20 07:15:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 07:15:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-11-20 07:15:33,684 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 186 [2024-11-20 07:15:33,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:15:33,685 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-11-20 07:15:33,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-20 07:15:33,685 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-11-20 07:15:33,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-20 07:15:33,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:15:33,690 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:15:33,720 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 (4)] Ended with exit code 0 [2024-11-20 07:15:33,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-20 07:15:33,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:15:33,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:15:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash 753580086, now seen corresponding path program 1 times [2024-11-20 07:15:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:15:33,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870754164] [2024-11-20 07:15:33,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:15:33,896 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-20 07:15:33,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:15:33,899 INFO L229 MonitoredProcess]: Starting monitored process 5 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-20 07:15:33,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 (5)] Waiting until timeout for monitored process [2024-11-20 07:15:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:15:34,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 07:15:34,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:15:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 207 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-20 07:15:41,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:15:42,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:15:42,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870754164] [2024-11-20 07:15:42,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870754164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:15:42,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1343282419] [2024-11-20 07:15:42,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:15:42,492 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 07:15:42,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 07:15:42,497 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 07:15:42,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-20 07:15:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:15:44,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 07:15:44,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:15:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 207 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-20 07:15:50,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:15:51,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1343282419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:15:51,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 07:15:51,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2024-11-20 07:15:51,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727469982] [2024-11-20 07:15:51,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 07:15:51,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 07:15:51,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:15:51,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 07:15:51,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-20 07:15:51,787 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-20 07:15:58,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []