./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-80.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-80.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 56064daaba05050964f220dcd42c097e23ee92990bd0e372b460532857ef7215 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:22:59,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:22:59,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 07:22:59,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:22:59,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:22:59,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:22:59,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:22:59,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:22:59,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:22:59,992 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:22:59,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:22:59,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:22:59,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:22:59,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:22:59,994 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:22:59,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:22:59,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:22:59,995 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:22:59,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 07:22:59,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:22:59,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:22:59,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:22:59,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:22:59,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:22:59,999 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:23:00,000 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:23:00,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:23:00,000 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:23:00,000 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:23:00,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:23:00,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:23:00,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:23:00,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:23:00,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:23:00,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:23:00,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:23:00,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 07:23:00,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 07:23:00,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:23:00,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:23:00,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:23:00,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:23:00,004 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 -> 56064daaba05050964f220dcd42c097e23ee92990bd0e372b460532857ef7215 [2024-11-20 07:23:00,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:23:00,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:23:00,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:23:00,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:23:00,252 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:23:00,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i [2024-11-20 07:23:01,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:23:01,814 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:23:01,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i [2024-11-20 07:23:01,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e37b4c2b5/0071efc3dc274221b0edfbcbcfb12f6e/FLAG2ead4912a [2024-11-20 07:23:02,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e37b4c2b5/0071efc3dc274221b0edfbcbcfb12f6e [2024-11-20 07:23:02,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:23:02,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:23:02,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:23:02,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:23:02,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:23:02,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:23:02" (1/1) ... [2024-11-20 07:23:02,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f7fb9cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:02, skipping insertion in model container [2024-11-20 07:23:02,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:23:02" (1/1) ... [2024-11-20 07:23:02,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:23:02,385 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-80.i[916,929] [2024-11-20 07:23:02,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:23:02,458 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:23:02,469 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-80.i[916,929] [2024-11-20 07:23:02,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:23:02,598 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:23:02,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:02 WrapperNode [2024-11-20 07:23:02,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:23:02,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:23:02,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:23:02,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:23:02,608 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:23:02" (1/1) ... [2024-11-20 07:23:02,623 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:23:02" (1/1) ... [2024-11-20 07:23:02,661 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2024-11-20 07:23:02,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:23:02,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:23:02,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:23:02,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:23:02,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:02" (1/1) ... [2024-11-20 07:23:02,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:02" (1/1) ... [2024-11-20 07:23:02,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:02" (1/1) ... [2024-11-20 07:23:02,734 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:23:02,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:02" (1/1) ... [2024-11-20 07:23:02,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:02" (1/1) ... [2024-11-20 07:23:02,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:02" (1/1) ... [2024-11-20 07:23:02,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:02" (1/1) ... [2024-11-20 07:23:02,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:02" (1/1) ... [2024-11-20 07:23:02,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:02" (1/1) ... [2024-11-20 07:23:02,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:23:02,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:23:02,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:23:02,775 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:23:02,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:02" (1/1) ... [2024-11-20 07:23:02,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:23:02,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:23:02,807 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:23:02,809 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:23:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:23:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:23:02,849 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:23:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 07:23:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:23:02,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:23:02,920 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:23:02,923 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:23:03,268 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-20 07:23:03,269 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:23:03,286 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:23:03,286 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:23:03,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:23:03 BoogieIcfgContainer [2024-11-20 07:23:03,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:23:03,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:23:03,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:23:03,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:23:03,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:23:02" (1/3) ... [2024-11-20 07:23:03,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eaaf6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:23:03, skipping insertion in model container [2024-11-20 07:23:03,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:02" (2/3) ... [2024-11-20 07:23:03,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eaaf6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:23:03, skipping insertion in model container [2024-11-20 07:23:03,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:23:03" (3/3) ... [2024-11-20 07:23:03,306 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-80.i [2024-11-20 07:23:03,320 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:23:03,320 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:23:03,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:23:03,418 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;@6048d385, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:23:03,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:23:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 78 states have internal predecessors, (114), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 07:23:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-20 07:23:03,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:23:03,447 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:03,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:23:03,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:23:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash 602409142, now seen corresponding path program 1 times [2024-11-20 07:23:03,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:23:03,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474927396] [2024-11-20 07:23:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:03,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:23:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:23:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 07:23:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 07:23:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 07:23:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 07:23:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:23:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:23:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 07:23:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 07:23:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 07:23:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:23:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:23:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 07:23:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 07:23:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 07:23:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 07:23:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 07:23:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:23:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:23:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:23:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:23:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:23:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 07:23:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 07:23:03,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:23:03,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474927396] [2024-11-20 07:23:03,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474927396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:23:03,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:23:03,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:23:03,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356064091] [2024-11-20 07:23:03,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:23:03,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:23:03,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:23:03,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:23:03,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:23:03,903 INFO L87 Difference]: Start difference. First operand has 103 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 78 states have internal predecessors, (114), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 07:23:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:23:03,935 INFO L93 Difference]: Finished difference Result 199 states and 337 transitions. [2024-11-20 07:23:03,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:23:03,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 161 [2024-11-20 07:23:03,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:23:03,946 INFO L225 Difference]: With dead ends: 199 [2024-11-20 07:23:03,946 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 07:23:03,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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:23:03,952 INFO L432 NwaCegarLoop]: 153 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, 153 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:23:03,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:23:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 07:23:04,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-20 07:23:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.445945945945946) internal successors, (107), 74 states have internal predecessors, (107), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 07:23:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions. [2024-11-20 07:23:04,024 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 161 [2024-11-20 07:23:04,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:23:04,024 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 153 transitions. [2024-11-20 07:23:04,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 07:23:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2024-11-20 07:23:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-20 07:23:04,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:23:04,028 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:04,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 07:23:04,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:23:04,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:23:04,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1521201364, now seen corresponding path program 1 times [2024-11-20 07:23:04,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:23:04,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130795283] [2024-11-20 07:23:04,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:04,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:23:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:23:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 07:23:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 07:23:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 07:23:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 07:23:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:23:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:23:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 07:23:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 07:23:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 07:23:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:23:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:23:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 07:23:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 07:23:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 07:23:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 07:23:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 07:23:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:23:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:23:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:23:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:23:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:23:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 07:23:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 07:23:04,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:23:04,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130795283] [2024-11-20 07:23:04,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130795283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:23:04,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:23:04,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:23:04,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992935017] [2024-11-20 07:23:04,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:23:04,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:23:04,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:23:04,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:23:04,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:23:04,377 INFO L87 Difference]: Start difference. First operand 99 states and 153 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 07:23:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:23:04,461 INFO L93 Difference]: Finished difference Result 245 states and 376 transitions. [2024-11-20 07:23:04,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:23:04,462 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 161 [2024-11-20 07:23:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:23:04,466 INFO L225 Difference]: With dead ends: 245 [2024-11-20 07:23:04,466 INFO L226 Difference]: Without dead ends: 149 [2024-11-20 07:23:04,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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:23:04,470 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 77 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:23:04,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 270 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:23:04,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-20 07:23:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-11-20 07:23:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 119 states have internal predecessors, (171), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-20 07:23:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2024-11-20 07:23:04,488 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 161 [2024-11-20 07:23:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:23:04,488 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2024-11-20 07:23:04,489 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 07:23:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2024-11-20 07:23:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-20 07:23:04,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:23:04,494 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:04,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 07:23:04,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:23:04,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:23:04,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1195834440, now seen corresponding path program 1 times [2024-11-20 07:23:04,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:23:04,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856677613] [2024-11-20 07:23:04,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:04,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:23:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:23:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 07:23:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 07:23:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 07:23:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 07:23:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:23:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:23:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 07:23:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 07:23:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 07:23:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:23:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:23:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 07:23:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 07:23:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 07:23:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 07:23:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 07:23:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:23:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:23:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:23:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:23:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:23:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 07:23:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 07:23:05,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:23:05,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856677613] [2024-11-20 07:23:05,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856677613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:23:05,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:23:05,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 07:23:05,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123422179] [2024-11-20 07:23:05,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:23:05,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 07:23:05,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:23:05,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 07:23:05,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 07:23:05,237 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 07:23:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:23:05,913 INFO L93 Difference]: Finished difference Result 608 states and 918 transitions. [2024-11-20 07:23:05,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 07:23:05,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2024-11-20 07:23:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:23:05,918 INFO L225 Difference]: With dead ends: 608 [2024-11-20 07:23:05,918 INFO L226 Difference]: Without dead ends: 465 [2024-11-20 07:23:05,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:23:05,920 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 435 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 07:23:05,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 586 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 07:23:05,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-20 07:23:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 367. [2024-11-20 07:23:05,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 287 states have (on average 1.4355400696864111) internal successors, (412), 290 states have internal predecessors, (412), 73 states have call successors, (73), 6 states have call predecessors, (73), 6 states have return successors, (73), 70 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-20 07:23:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 558 transitions. [2024-11-20 07:23:05,965 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 558 transitions. Word has length 162 [2024-11-20 07:23:05,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:23:05,966 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 558 transitions. [2024-11-20 07:23:05,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 07:23:05,966 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 558 transitions. [2024-11-20 07:23:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-20 07:23:05,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:23:05,969 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:05,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 07:23:05,969 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:23:05,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:23:05,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2088015606, now seen corresponding path program 1 times [2024-11-20 07:23:05,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:23:05,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621852558] [2024-11-20 07:23:05,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:05,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:23:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:23:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 07:23:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 07:23:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 07:23:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 07:23:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:23:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:23:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 07:23:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 07:23:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 07:23:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:23:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:23:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 07:23:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 07:23:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 07:23:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 07:23:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 07:23:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:23:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:23:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:23:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:23:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:23:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 07:23:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 07:23:06,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:23:06,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621852558] [2024-11-20 07:23:06,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621852558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:23:06,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:23:06,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 07:23:06,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078165682] [2024-11-20 07:23:06,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:23:06,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 07:23:06,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:23:06,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 07:23:06,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:23:06,509 INFO L87 Difference]: Start difference. First operand 367 states and 558 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 07:23:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:23:07,161 INFO L93 Difference]: Finished difference Result 1525 states and 2326 transitions. [2024-11-20 07:23:07,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 07:23:07,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2024-11-20 07:23:07,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:23:07,168 INFO L225 Difference]: With dead ends: 1525 [2024-11-20 07:23:07,168 INFO L226 Difference]: Without dead ends: 1161 [2024-11-20 07:23:07,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-20 07:23:07,171 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 680 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 07:23:07,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 975 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 07:23:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-11-20 07:23:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 565. [2024-11-20 07:23:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 460 states have (on average 1.4565217391304348) internal successors, (670), 463 states have internal predecessors, (670), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-20 07:23:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 862 transitions. [2024-11-20 07:23:07,242 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 862 transitions. Word has length 162 [2024-11-20 07:23:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:23:07,242 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 862 transitions. [2024-11-20 07:23:07,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 07:23:07,243 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 862 transitions. [2024-11-20 07:23:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-20 07:23:07,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:23:07,245 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:07,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 07:23:07,245 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:23:07,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:23:07,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1954002100, now seen corresponding path program 1 times [2024-11-20 07:23:07,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:23:07,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662194609] [2024-11-20 07:23:07,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:07,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:23:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:23:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 07:23:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 07:23:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 07:23:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 07:23:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:23:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:23:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 07:23:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 07:23:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 07:23:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:23:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:23:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 07:23:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 07:23:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 07:23:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 07:23:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 07:23:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:23:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:23:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:23:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:23:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:23:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 07:23:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 07:23:07,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:23:07,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662194609] [2024-11-20 07:23:07,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662194609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:23:07,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:23:07,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 07:23:07,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488139423] [2024-11-20 07:23:07,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:23:07,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 07:23:07,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:23:07,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 07:23:07,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:23:07,786 INFO L87 Difference]: Start difference. First operand 565 states and 862 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 07:23:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:23:08,587 INFO L93 Difference]: Finished difference Result 1579 states and 2399 transitions. [2024-11-20 07:23:08,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 07:23:08,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2024-11-20 07:23:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:23:08,599 INFO L225 Difference]: With dead ends: 1579 [2024-11-20 07:23:08,599 INFO L226 Difference]: Without dead ends: 1215 [2024-11-20 07:23:08,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-20 07:23:08,602 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 429 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 07:23:08,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 888 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 07:23:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2024-11-20 07:23:08,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 644. [2024-11-20 07:23:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 539 states have (on average 1.4749536178107607) internal successors, (795), 542 states have internal predecessors, (795), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-20 07:23:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 987 transitions. [2024-11-20 07:23:08,698 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 987 transitions. Word has length 162 [2024-11-20 07:23:08,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:23:08,698 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 987 transitions. [2024-11-20 07:23:08,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 07:23:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 987 transitions. [2024-11-20 07:23:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-20 07:23:08,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:23:08,701 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:08,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 07:23:08,702 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:23:08,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:23:08,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1578542516, now seen corresponding path program 1 times [2024-11-20 07:23:08,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:23:08,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162275341] [2024-11-20 07:23:08,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:08,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:23:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:23:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 07:23:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 07:23:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 07:23:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 07:23:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:23:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:23:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 07:23:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 07:23:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 07:23:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:23:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:23:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 07:23:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 07:23:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 07:23:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 07:23:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 07:23:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:23:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:23:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:23:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:23:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:23:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 07:23:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 07:23:09,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:23:09,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162275341] [2024-11-20 07:23:09,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162275341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:23:09,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:23:09,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 07:23:09,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772410672] [2024-11-20 07:23:09,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:23:09,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 07:23:09,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:23:09,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 07:23:09,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:23:09,294 INFO L87 Difference]: Start difference. First operand 644 states and 987 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 07:23:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:23:09,941 INFO L93 Difference]: Finished difference Result 1634 states and 2502 transitions. [2024-11-20 07:23:09,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 07:23:09,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2024-11-20 07:23:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:23:09,946 INFO L225 Difference]: With dead ends: 1634 [2024-11-20 07:23:09,946 INFO L226 Difference]: Without dead ends: 1191 [2024-11-20 07:23:09,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-20 07:23:09,948 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 333 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 07:23:09,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1025 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 07:23:09,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2024-11-20 07:23:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 644. [2024-11-20 07:23:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 539 states have (on average 1.4749536178107607) internal successors, (795), 542 states have internal predecessors, (795), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-20 07:23:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 987 transitions. [2024-11-20 07:23:10,005 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 987 transitions. Word has length 162 [2024-11-20 07:23:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:23:10,005 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 987 transitions. [2024-11-20 07:23:10,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 07:23:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 987 transitions. [2024-11-20 07:23:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-20 07:23:10,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:23:10,007 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:10,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 07:23:10,008 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:23:10,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:23:10,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1874104475, now seen corresponding path program 1 times [2024-11-20 07:23:10,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:23:10,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967696630] [2024-11-20 07:23:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:10,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:23:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:23:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 07:23:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 07:23:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 07:23:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 07:23:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:23:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:23:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 07:23:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 07:23:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 07:23:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:23:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:23:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 07:23:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 07:23:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 07:23:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 07:23:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 07:23:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:23:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:23:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:23:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:23:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:23:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 07:23:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 07:23:10,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:23:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967696630] [2024-11-20 07:23:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967696630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:23:10,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:23:10,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 07:23:10,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198847724] [2024-11-20 07:23:10,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:23:10,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 07:23:10,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:23:10,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 07:23:10,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:23:10,379 INFO L87 Difference]: Start difference. First operand 644 states and 987 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 07:23:10,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:23:10,932 INFO L93 Difference]: Finished difference Result 1629 states and 2482 transitions. [2024-11-20 07:23:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 07:23:10,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 163 [2024-11-20 07:23:10,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:23:10,937 INFO L225 Difference]: With dead ends: 1629 [2024-11-20 07:23:10,937 INFO L226 Difference]: Without dead ends: 1116 [2024-11-20 07:23:10,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-20 07:23:10,939 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 395 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 07:23:10,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 782 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 07:23:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-20 07:23:10,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 644. [2024-11-20 07:23:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 539 states have (on average 1.4656771799628943) internal successors, (790), 542 states have internal predecessors, (790), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-20 07:23:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 982 transitions. [2024-11-20 07:23:10,994 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 982 transitions. Word has length 163 [2024-11-20 07:23:10,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:23:10,994 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 982 transitions. [2024-11-20 07:23:10,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-20 07:23:10,995 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 982 transitions. [2024-11-20 07:23:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-20 07:23:10,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:23:10,996 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:10,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 07:23:10,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:23:10,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:23:10,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2014653085, now seen corresponding path program 1 times [2024-11-20 07:23:10,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:23:10,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515825671] [2024-11-20 07:23:10,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:10,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:23:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:23:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 07:23:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 07:23:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 07:23:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 07:23:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:23:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:23:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 07:23:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 07:23:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 07:23:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:23:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:23:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 07:23:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 07:23:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 07:23:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 07:23:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 07:23:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:23:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:23:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:23:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:23:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:23:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 07:23:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 07:23:11,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:23:11,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515825671] [2024-11-20 07:23:11,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515825671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:23:11,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:23:11,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 07:23:11,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161908204] [2024-11-20 07:23:11,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:23:11,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 07:23:11,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:23:11,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 07:23:11,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 07:23:11,638 INFO L87 Difference]: Start difference. First operand 644 states and 982 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 07:23:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:23:12,258 INFO L93 Difference]: Finished difference Result 1512 states and 2313 transitions. [2024-11-20 07:23:12,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 07:23:12,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 163 [2024-11-20 07:23:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:23:12,264 INFO L225 Difference]: With dead ends: 1512 [2024-11-20 07:23:12,264 INFO L226 Difference]: Without dead ends: 1069 [2024-11-20 07:23:12,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-20 07:23:12,266 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 605 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 07:23:12,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 802 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 07:23:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2024-11-20 07:23:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 692. [2024-11-20 07:23:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 587 states have (on average 1.4804088586030664) internal successors, (869), 590 states have internal predecessors, (869), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-20 07:23:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1061 transitions. [2024-11-20 07:23:12,321 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1061 transitions. Word has length 163 [2024-11-20 07:23:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:23:12,322 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1061 transitions. [2024-11-20 07:23:12,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 07:23:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1061 transitions. [2024-11-20 07:23:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-20 07:23:12,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:23:12,324 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:12,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 07:23:12,324 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:23:12,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:23:12,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2083825611, now seen corresponding path program 1 times [2024-11-20 07:23:12,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:23:12,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785366840] [2024-11-20 07:23:12,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:12,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:23:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:23:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 07:23:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 07:23:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 07:23:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 07:23:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:23:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:23:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 07:23:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 07:23:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 07:23:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:23:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:23:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 07:23:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 07:23:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 07:23:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 07:23:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 07:23:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:23:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:23:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:23:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:23:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:23:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 07:23:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 07:23:12,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:23:12,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785366840] [2024-11-20 07:23:12,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785366840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:23:12,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124485009] [2024-11-20 07:23:12,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:12,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:23:12,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:23:12,535 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:23:12,550 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:23:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:12,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 07:23:12,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:23:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-20 07:23:12,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:23:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 07:23:13,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124485009] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:23:13,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 07:23:13,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-20 07:23:13,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867765322] [2024-11-20 07:23:13,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 07:23:13,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 07:23:13,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:23:13,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 07:23:13,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:23:13,163 INFO L87 Difference]: Start difference. First operand 692 states and 1061 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-20 07:23:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:23:13,397 INFO L93 Difference]: Finished difference Result 1349 states and 2053 transitions. [2024-11-20 07:23:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 07:23:13,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 163 [2024-11-20 07:23:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:23:13,402 INFO L225 Difference]: With dead ends: 1349 [2024-11-20 07:23:13,403 INFO L226 Difference]: Without dead ends: 711 [2024-11-20 07:23:13,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-20 07:23:13,405 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 151 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:23:13,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 328 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:23:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-20 07:23:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 703. [2024-11-20 07:23:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 594 states have (on average 1.4343434343434343) internal successors, (852), 597 states have internal predecessors, (852), 96 states have call successors, (96), 12 states have call predecessors, (96), 12 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-20 07:23:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1044 transitions. [2024-11-20 07:23:13,479 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1044 transitions. Word has length 163 [2024-11-20 07:23:13,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:23:13,480 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 1044 transitions. [2024-11-20 07:23:13,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-20 07:23:13,480 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1044 transitions. [2024-11-20 07:23:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-20 07:23:13,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:23:13,482 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:13,493 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:23:13,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:23:13,686 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:23:13,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:23:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1138529011, now seen corresponding path program 1 times [2024-11-20 07:23:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:23:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926831872] [2024-11-20 07:23:13,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:13,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:23:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:23:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 07:23:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 07:23:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 07:23:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 07:23:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:23:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:23:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 07:23:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 07:23:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 07:23:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:23:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:23:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 07:23:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 07:23:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 07:23:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 07:23:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 07:23:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:23:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:23:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:23:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:23:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:23:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 07:23:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 07:23:13,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:23:13,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926831872] [2024-11-20 07:23:13,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926831872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:23:13,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965227205] [2024-11-20 07:23:13,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:13,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:23:13,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:23:13,894 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:23:13,902 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:23:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:14,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 07:23:14,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:23:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 186 proven. 60 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-20 07:23:14,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:23:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 07:23:14,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965227205] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:23:14,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 07:23:14,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-20 07:23:14,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016432644] [2024-11-20 07:23:14,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 07:23:14,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 07:23:14,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:23:14,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 07:23:14,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:23:14,383 INFO L87 Difference]: Start difference. First operand 703 states and 1044 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-20 07:23:14,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:23:14,543 INFO L93 Difference]: Finished difference Result 1183 states and 1730 transitions. [2024-11-20 07:23:14,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 07:23:14,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 163 [2024-11-20 07:23:14,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:23:14,546 INFO L225 Difference]: With dead ends: 1183 [2024-11-20 07:23:14,546 INFO L226 Difference]: Without dead ends: 537 [2024-11-20 07:23:14,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-20 07:23:14,548 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 161 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:23:14,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 289 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:23:14,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-20 07:23:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 412. [2024-11-20 07:23:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 330 states have (on average 1.3575757575757577) internal successors, (448), 330 states have internal predecessors, (448), 69 states have call successors, (69), 12 states have call predecessors, (69), 12 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-20 07:23:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 586 transitions. [2024-11-20 07:23:14,584 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 586 transitions. Word has length 163 [2024-11-20 07:23:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:23:14,585 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 586 transitions. [2024-11-20 07:23:14,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-20 07:23:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 586 transitions. [2024-11-20 07:23:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-20 07:23:14,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:23:14,586 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:14,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 07:23:14,787 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,SelfDestructingSolverStorable9 [2024-11-20 07:23:14,787 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:23:14,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:23:14,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1630805149, now seen corresponding path program 1 times [2024-11-20 07:23:14,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:23:14,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553016524] [2024-11-20 07:23:14,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:14,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:23:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:23:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 07:23:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 07:23:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 07:23:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 07:23:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 07:23:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 07:23:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 07:23:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 07:23:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 07:23:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:23:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:23:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 07:23:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 07:23:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 07:23:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 07:23:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 07:23:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 07:23:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 07:23:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 07:23:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 07:23:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 07:23:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 07:23:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 114 proven. 12 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-11-20 07:23:15,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:23:15,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553016524] [2024-11-20 07:23:15,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553016524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:23:15,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530218612] [2024-11-20 07:23:15,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:15,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:23:15,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:23:15,137 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:23:15,140 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:23:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:15,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 07:23:15,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:23:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 411 proven. 12 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-20 07:23:15,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:23:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 114 proven. 15 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-20 07:23:15,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530218612] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:23:15,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 07:23:15,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-20 07:23:15,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108213311] [2024-11-20 07:23:15,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 07:23:15,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 07:23:15,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:23:15,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 07:23:15,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-20 07:23:15,828 INFO L87 Difference]: Start difference. First operand 412 states and 586 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-20 07:23:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:23:16,509 INFO L93 Difference]: Finished difference Result 1054 states and 1462 transitions. [2024-11-20 07:23:16,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-20 07:23:16,513 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) Word has length 165 [2024-11-20 07:23:16,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:23:16,516 INFO L225 Difference]: With dead ends: 1054 [2024-11-20 07:23:16,516 INFO L226 Difference]: Without dead ends: 768 [2024-11-20 07:23:16,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 369 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=762, Unknown=0, NotChecked=0, Total=1056 [2024-11-20 07:23:16,518 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 578 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 07:23:16,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 764 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 07:23:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-20 07:23:16,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 464. [2024-11-20 07:23:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 376 states have (on average 1.3457446808510638) internal successors, (506), 376 states have internal predecessors, (506), 69 states have call successors, (69), 18 states have call predecessors, (69), 18 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-20 07:23:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 644 transitions. [2024-11-20 07:23:16,564 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 644 transitions. Word has length 165 [2024-11-20 07:23:16,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:23:16,564 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 644 transitions. [2024-11-20 07:23:16,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-20 07:23:16,565 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 644 transitions. [2024-11-20 07:23:16,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-20 07:23:16,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:23:16,566 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:16,577 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:23:16,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:23:16,771 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:23:16,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:23:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1963097569, now seen corresponding path program 1 times [2024-11-20 07:23:16,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:23:16,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123573561] [2024-11-20 07:23:16,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:16,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:23:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 07:23:16,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690726423] [2024-11-20 07:23:16,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:16,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:23:16,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:23:16,814 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:23:16,815 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:23:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:23:16,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 07:23:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:23:17,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 07:23:17,037 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 07:23:17,038 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:23:17,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 07:23:17,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:23:17,245 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:23:17,330 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:23:17,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:23:17 BoogieIcfgContainer [2024-11-20 07:23:17,332 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:23:17,333 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:23:17,333 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:23:17,333 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:23:17,333 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:23:03" (3/4) ... [2024-11-20 07:23:17,335 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 07:23:17,336 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:23:17,336 INFO L158 Benchmark]: Toolchain (without parser) took 15132.15ms. Allocated memory was 159.4MB in the beginning and 572.5MB in the end (delta: 413.1MB). Free memory was 88.1MB in the beginning and 240.6MB in the end (delta: -152.5MB). Peak memory consumption was 263.0MB. Max. memory is 16.1GB. [2024-11-20 07:23:17,336 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory was 109.9MB in the beginning and 109.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:23:17,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.86ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 87.8MB in the beginning and 196.7MB in the end (delta: -109.0MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2024-11-20 07:23:17,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.73ms. Allocated memory is still 226.5MB. Free memory was 196.7MB in the beginning and 192.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 07:23:17,337 INFO L158 Benchmark]: Boogie Preprocessor took 110.25ms. Allocated memory is still 226.5MB. Free memory was 192.6MB in the beginning and 186.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 07:23:17,337 INFO L158 Benchmark]: RCFGBuilder took 513.05ms. Allocated memory is still 226.5MB. Free memory was 186.3MB in the beginning and 154.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-20 07:23:17,337 INFO L158 Benchmark]: TraceAbstraction took 14039.61ms. Allocated memory was 226.5MB in the beginning and 572.5MB in the end (delta: 346.0MB). Free memory was 153.8MB in the beginning and 240.6MB in the end (delta: -86.8MB). Peak memory consumption was 260.3MB. Max. memory is 16.1GB. [2024-11-20 07:23:17,337 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 572.5MB. Free memory is still 240.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:23:17,338 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.14ms. Allocated memory is still 159.4MB. Free memory was 109.9MB in the beginning and 109.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.86ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 87.8MB in the beginning and 196.7MB in the end (delta: -109.0MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.73ms. Allocated memory is still 226.5MB. Free memory was 196.7MB in the beginning and 192.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.25ms. Allocated memory is still 226.5MB. Free memory was 192.6MB in the beginning and 186.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 513.05ms. Allocated memory is still 226.5MB. Free memory was 186.3MB in the beginning and 154.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14039.61ms. Allocated memory was 226.5MB in the beginning and 572.5MB in the end (delta: 346.0MB). Free memory was 153.8MB in the beginning and 240.6MB in the end (delta: -86.8MB). Peak memory consumption was 260.3MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 572.5MB. Free memory is still 240.6MB. 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 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryArithmeticDOUBLEoperation at line 134. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.8; [L23] float var_1_6 = 16.375; [L24] float var_1_7 = 0.25; [L25] unsigned char var_1_8 = 1; [L26] unsigned char var_1_9 = 1; [L27] unsigned char var_1_10 = 0; [L28] unsigned long int var_1_11 = 128; [L29] double var_1_13 = 255.5; [L30] double var_1_14 = 0.0; [L31] double var_1_15 = 0.0; [L32] double var_1_16 = 100.3; [L33] unsigned long int var_1_17 = 32; [L34] unsigned short int var_1_19 = 100; [L35] double var_1_21 = 10000000000.5; [L36] double var_1_22 = 32.2; [L37] signed short int var_1_23 = -2; [L38] signed char var_1_24 = 32; [L39] signed char var_1_25 = 10; [L40] signed char var_1_26 = -128; [L41] double var_1_27 = 5.8; [L42] unsigned short int var_1_28 = 16; [L43] unsigned char var_1_30 = 1; [L44] unsigned char var_1_31 = 0; [L45] unsigned char var_1_32 = 0; [L46] unsigned long int var_1_33 = 256; [L47] unsigned char var_1_34 = 0; [L48] float var_1_35 = 3.625; [L49] float var_1_36 = 9.8; [L50] unsigned char var_1_37 = 4; [L51] unsigned long int last_1_var_1_17 = 32; [L52] double last_1_var_1_22 = 32.2; [L53] double last_1_var_1_27 = 5.8; [L54] unsigned char last_1_var_1_37 = 4; VAL [isInitial=0, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=131/8, var_1_7=1/4, var_1_8=1, var_1_9=1] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L182] last_1_var_1_17 = var_1_17 [L183] last_1_var_1_22 = var_1_22 [L184] last_1_var_1_27 = var_1_27 [L185] last_1_var_1_37 = var_1_37 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=131/8, var_1_7=1/4, var_1_8=1, var_1_9=1] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L144] var_1_6 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L146] var_1_7 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L147] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L148] var_1_9 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L149] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L150] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L151] var_1_10 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L152] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L154] var_1_14 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L155] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L156] var_1_15 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L157] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L158] var_1_16 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L159] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L160] var_1_24 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L161] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L162] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L162] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L163] var_1_25 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L164] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L165] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L165] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L166] var_1_26 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_26 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L167] RET assume_abort_if_not(var_1_26 >= -128) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L168] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L168] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_26 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L169] RET assume_abort_if_not(var_1_26 != 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L170] var_1_31 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L171] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L172] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L172] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L173] var_1_33 = __VERIFIER_nondet_ulong() [L174] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L174] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L175] CALL assume_abort_if_not(var_1_33 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L175] RET assume_abort_if_not(var_1_33 <= 4294967295) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L176] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L176] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L177] var_1_34 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L178] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L179] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L179] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L196] RET updateVariables() [L197] CALL step() [L58] COND TRUE (- last_1_var_1_27) < var_1_7 [L59] var_1_21 = 0.19999999999999996 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L63] COND TRUE ((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16) [L64] var_1_28 = ((var_1_25 + (100 + 64)) + last_1_var_1_37) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L68] COND TRUE \read(var_1_9) [L69] var_1_11 = 0u VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L79] COND TRUE \read(var_1_9) [L80] var_1_30 = (! var_1_31) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L82] var_1_35 = var_1_16 [L83] var_1_36 = var_1_14 [L84] var_1_37 = var_1_25 [L85] unsigned char stepLocal_3 = var_1_37; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_3=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L86] COND FALSE !(var_1_28 <= stepLocal_3) [L89] var_1_19 = ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L91] unsigned long int stepLocal_0 = 1u; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L92] COND FALSE !(((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L97] signed long int stepLocal_4 = (var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4))); VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_4=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L98] COND FALSE !(stepLocal_4 > var_1_37) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L101] signed long int stepLocal_2 = var_1_19 - var_1_19; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L102] COND TRUE \read(var_1_9) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L103] COND TRUE \read(var_1_10) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L104] EXPR (last_1_var_1_17 / -64) << var_1_11 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L104] COND TRUE ((last_1_var_1_17 / -64) << var_1_11) >= stepLocal_2 [L105] var_1_17 = var_1_19 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L113] EXPR var_1_37 ^ (4u / var_1_33) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L113] COND FALSE !((var_1_37 ^ (4u / var_1_33)) != var_1_17) [L116] var_1_32 = (var_1_31 || var_1_34) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L118] COND FALSE !(((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L121] signed long int stepLocal_5 = var_1_19 + var_1_37; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_5=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L122] COND TRUE var_1_28 != stepLocal_5 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L123] COND FALSE !(var_1_1 < var_1_21) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L127] COND FALSE !(((var_1_16 * var_1_6) > var_1_15) && var_1_32) [L130] var_1_22 = ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L132] unsigned short int stepLocal_1 = var_1_28; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_1=168, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L133] COND TRUE var_1_7 != (var_1_27 * var_1_6) [L134] var_1_13 = ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_1=168, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L197] RET step() [L198] CALL, EXPR property() [L188] EXPR (((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L188] EXPR (((((((((((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u)))) && ((var_1_28 <= var_1_37) ? (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))) : (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))))) && (((- last_1_var_1_27) < var_1_7) ? (var_1_21 == ((double) 0.19999999999999996)) : (var_1_21 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))))) && ((((var_1_16 * var_1_6) > var_1_15) && var_1_32) ? (var_1_22 == ((double) var_1_6)) : (var_1_22 == ((double) ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))))))) && ((((var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4)))) > var_1_37) ? (var_1_23 == ((signed short int) var_1_24)) : 1)) && ((var_1_28 != (var_1_19 + var_1_37)) ? ((var_1_1 < var_1_21) ? (var_1_27 == ((double) (var_1_15 - var_1_16))) : 1) : 1)) && ((((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16)) ? (var_1_28 == ((unsigned short int) ((var_1_25 + (100 + 64)) + last_1_var_1_37))) : (var_1_28 == ((unsigned short int) last_1_var_1_37)))) && (var_1_9 ? (var_1_30 == ((unsigned char) (! var_1_31))) : 1)) && (((var_1_37 ^ (4u / var_1_33)) != var_1_17) ? (var_1_32 == ((unsigned char) ((99.6f != var_1_7) || var_1_10))) : (var_1_32 == ((unsigned char) (var_1_31 || var_1_34)))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L188-L189] return ((((((((((((((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u)))) && ((var_1_28 <= var_1_37) ? (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))) : (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))))) && (((- last_1_var_1_27) < var_1_7) ? (var_1_21 == ((double) 0.19999999999999996)) : (var_1_21 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))))) && ((((var_1_16 * var_1_6) > var_1_15) && var_1_32) ? (var_1_22 == ((double) var_1_6)) : (var_1_22 == ((double) ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))))))) && ((((var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4)))) > var_1_37) ? (var_1_23 == ((signed short int) var_1_24)) : 1)) && ((var_1_28 != (var_1_19 + var_1_37)) ? ((var_1_1 < var_1_21) ? (var_1_27 == ((double) (var_1_15 - var_1_16))) : 1) : 1)) && ((((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16)) ? (var_1_28 == ((unsigned short int) ((var_1_25 + (100 + 64)) + last_1_var_1_37))) : (var_1_28 == ((unsigned short int) last_1_var_1_37)))) && (var_1_9 ? (var_1_30 == ((unsigned char) (! var_1_31))) : 1)) && (((var_1_37 ^ (4u / var_1_33)) != var_1_17) ? (var_1_32 == ((unsigned char) ((99.6f != var_1_7) || var_1_10))) : (var_1_32 == ((unsigned char) (var_1_31 || var_1_34))))) && (var_1_35 == ((float) var_1_16))) && (var_1_36 == ((float) var_1_14))) && (var_1_37 == ((unsigned char) var_1_25)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 12, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3868 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3844 mSDsluCounter, 6862 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4986 mSDsCounter, 959 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3306 IncrementalHoareTripleChecker+Invalid, 4265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 959 mSolverCounterUnsat, 1876 mSDtfsCounter, 3306 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1639 GetRequests, 1524 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=703occurred in iteration=9, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 3101 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2608 NumberOfCodeBlocks, 2608 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2752 ConstructedInterpolants, 0 QuantifiedInterpolants, 9933 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1194 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 16823/17204 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:23:17,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-80.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 56064daaba05050964f220dcd42c097e23ee92990bd0e372b460532857ef7215 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:23:19,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:23:19,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 07:23:19,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:23:19,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:23:19,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:23:19,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:23:19,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:23:19,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:23:19,738 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:23:19,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:23:19,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:23:19,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:23:19,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:23:19,740 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:23:19,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:23:19,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:23:19,741 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:23:19,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:23:19,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:23:19,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:23:19,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:23:19,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:23:19,746 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 07:23:19,750 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 07:23:19,750 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:23:19,751 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 07:23:19,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:23:19,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:23:19,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:23:19,751 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:23:19,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:23:19,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:23:19,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:23:19,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:23:19,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:23:19,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:23:19,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:23:19,753 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 07:23:19,753 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 07:23:19,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:23:19,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:23:19,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:23:19,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:23:19,756 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 -> 56064daaba05050964f220dcd42c097e23ee92990bd0e372b460532857ef7215 [2024-11-20 07:23:20,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:23:20,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:23:20,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:23:20,120 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:23:20,124 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:23:20,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i [2024-11-20 07:23:21,413 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:23:21,670 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:23:21,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i [2024-11-20 07:23:21,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1102a2e7/ec8f2294a6884f619374eae10cda5a1f/FLAG7b2ef80af [2024-11-20 07:23:22,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1102a2e7/ec8f2294a6884f619374eae10cda5a1f [2024-11-20 07:23:22,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:23:22,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:23:22,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:23:22,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:23:22,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:23:22,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:23:22" (1/1) ... [2024-11-20 07:23:22,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19aa117e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:22, skipping insertion in model container [2024-11-20 07:23:22,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:23:22" (1/1) ... [2024-11-20 07:23:22,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:23:22,295 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-80.i[916,929] [2024-11-20 07:23:22,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:23:22,436 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:23:22,447 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-80.i[916,929] [2024-11-20 07:23:22,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:23:22,513 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:23:22,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:22 WrapperNode [2024-11-20 07:23:22,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:23:22,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:23:22,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:23:22,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:23:22,520 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:23:22" (1/1) ... [2024-11-20 07:23:22,537 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:23:22" (1/1) ... [2024-11-20 07:23:22,581 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-20 07:23:22,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:23:22,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:23:22,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:23:22,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:23:22,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:22" (1/1) ... [2024-11-20 07:23:22,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:22" (1/1) ... [2024-11-20 07:23:22,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:22" (1/1) ... [2024-11-20 07:23:22,617 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:23:22,617 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:22" (1/1) ... [2024-11-20 07:23:22,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:22" (1/1) ... [2024-11-20 07:23:22,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:22" (1/1) ... [2024-11-20 07:23:22,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:22" (1/1) ... [2024-11-20 07:23:22,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:22" (1/1) ... [2024-11-20 07:23:22,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:22" (1/1) ... [2024-11-20 07:23:22,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:23:22,665 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:23:22,665 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:23:22,665 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:23:22,666 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:22" (1/1) ... [2024-11-20 07:23:22,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:23:22,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:23:22,702 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:23:22,712 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:23:22,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:23:22,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 07:23:22,749 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:23:22,749 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:23:22,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:23:22,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:23:22,834 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:23:22,836 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:23:43,684 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 07:23:43,684 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:23:43,703 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:23:43,703 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:23:43,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:23:43 BoogieIcfgContainer [2024-11-20 07:23:43,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:23:43,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:23:43,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:23:43,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:23:43,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:23:22" (1/3) ... [2024-11-20 07:23:43,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a6076f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:23:43, skipping insertion in model container [2024-11-20 07:23:43,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:23:22" (2/3) ... [2024-11-20 07:23:43,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a6076f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:23:43, skipping insertion in model container [2024-11-20 07:23:43,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:23:43" (3/3) ... [2024-11-20 07:23:43,711 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-80.i [2024-11-20 07:23:43,725 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:23:43,726 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:23:43,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:23:43,792 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;@341bed67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:23:43,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:23:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 07:23:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 07:23:43,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:23:43,813 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:43,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:23:43,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:23:43,818 INFO L85 PathProgramCache]: Analyzing trace with hash 120401077, now seen corresponding path program 1 times [2024-11-20 07:23:43,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:23:43,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653626940] [2024-11-20 07:23:43,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:43,835 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:23:43,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:23:43,839 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:23:43,845 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:23:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:44,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 07:23:44,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:23:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-20 07:23:44,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:23:44,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:23:44,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653626940] [2024-11-20 07:23:44,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653626940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:23:44,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:23:44,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:23:44,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075665832] [2024-11-20 07:23:44,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:23:44,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:23:44,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:23:44,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:23:44,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:23:44,872 INFO L87 Difference]: Start difference. First operand has 81 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 07:23:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:23:44,893 INFO L93 Difference]: Finished difference Result 155 states and 269 transitions. [2024-11-20 07:23:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:23:44,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2024-11-20 07:23:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:23:44,910 INFO L225 Difference]: With dead ends: 155 [2024-11-20 07:23:44,910 INFO L226 Difference]: Without dead ends: 77 [2024-11-20 07:23:44,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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:23:44,915 INFO L432 NwaCegarLoop]: 119 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, 119 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:23:44,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:23:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-20 07:23:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-20 07:23:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-20 07:23:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 119 transitions. [2024-11-20 07:23:44,963 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 119 transitions. Word has length 156 [2024-11-20 07:23:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:23:44,964 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 119 transitions. [2024-11-20 07:23:44,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-20 07:23:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 119 transitions. [2024-11-20 07:23:44,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 07:23:44,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:23:44,968 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:44,995 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:23:45,168 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:23:45,169 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:23:45,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:23:45,170 INFO L85 PathProgramCache]: Analyzing trace with hash 71316607, now seen corresponding path program 1 times [2024-11-20 07:23:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:23:45,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453442260] [2024-11-20 07:23:45,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:23:45,171 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:23:45,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:23:45,174 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:23:45,175 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:23:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:23:46,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 07:23:46,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:23:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-20 07:23:54,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:23:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 07:23:57,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:23:57,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453442260] [2024-11-20 07:23:57,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453442260] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:23:57,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 07:23:57,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2024-11-20 07:23:57,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691626746] [2024-11-20 07:23:57,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 07:23:57,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 07:23:57,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:23:57,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 07:23:57,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-20 07:23:57,996 INFO L87 Difference]: Start difference. First operand 77 states and 119 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-20 07:24:08,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 07:24:12,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 07:24:20,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 07:24:24,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 07:24:28,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 07:24:32,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 07:24:36,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []