./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.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 b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:41:03,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:41:03,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:41:03,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:41:03,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:41:04,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:41:04,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:41:04,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:41:04,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:41:04,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:41:04,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:41:04,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:41:04,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:41:04,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:41:04,028 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:41:04,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:41:04,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:41:04,029 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:41:04,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:41:04,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:41:04,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:41:04,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:41:04,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:41:04,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:41:04,034 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:41:04,034 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:41:04,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:41:04,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:41:04,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:41:04,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:41:04,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:41:04,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:41:04,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:41:04,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:41:04,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:41:04,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:41:04,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:41:04,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:41:04,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:41:04,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:41:04,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:41:04,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:41:04,040 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 -> b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d [2024-11-08 21:41:04,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:41:04,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:41:04,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:41:04,359 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:41:04,360 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:41:04,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-11-08 21:41:05,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:41:06,001 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:41:06,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-11-08 21:41:06,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90dd71909/3be4183e66fb46eaab2cc7ca4526dd26/FLAG753f959b0 [2024-11-08 21:41:06,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90dd71909/3be4183e66fb46eaab2cc7ca4526dd26 [2024-11-08 21:41:06,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:41:06,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:41:06,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:41:06,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:41:06,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:41:06,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:41:06" (1/1) ... [2024-11-08 21:41:06,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd346f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:06, skipping insertion in model container [2024-11-08 21:41:06,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:41:06" (1/1) ... [2024-11-08 21:41:06,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:41:06,567 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_fillercode_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2024-11-08 21:41:06,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:41:06,648 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:41:06,658 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_fillercode_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2024-11-08 21:41:06,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:41:06,740 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:41:06,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:06 WrapperNode [2024-11-08 21:41:06,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:41:06,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:41:06,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:41:06,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:41:06,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:06" (1/1) ... [2024-11-08 21:41:06,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:06" (1/1) ... [2024-11-08 21:41:06,800 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-11-08 21:41:06,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:41:06,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:41:06,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:41:06,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:41:06,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:06" (1/1) ... [2024-11-08 21:41:06,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:06" (1/1) ... [2024-11-08 21:41:06,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:06" (1/1) ... [2024-11-08 21:41:06,840 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-08 21:41:06,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:06" (1/1) ... [2024-11-08 21:41:06,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:06" (1/1) ... [2024-11-08 21:41:06,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:06" (1/1) ... [2024-11-08 21:41:06,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:06" (1/1) ... [2024-11-08 21:41:06,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:06" (1/1) ... [2024-11-08 21:41:06,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:06" (1/1) ... [2024-11-08 21:41:06,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:41:06,885 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:41:06,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:41:06,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:41:06,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:06" (1/1) ... [2024-11-08 21:41:06,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:41:06,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:41:06,929 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-08 21:41:06,932 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-08 21:41:06,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:41:06,979 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:41:06,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:41:06,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:41:06,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:41:06,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:41:07,082 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:41:07,084 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:41:07,464 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 21:41:07,465 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:41:07,486 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:41:07,493 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:41:07,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:41:07 BoogieIcfgContainer [2024-11-08 21:41:07,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:41:07,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:41:07,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:41:07,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:41:07,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:41:06" (1/3) ... [2024-11-08 21:41:07,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@807b0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:41:07, skipping insertion in model container [2024-11-08 21:41:07,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:06" (2/3) ... [2024-11-08 21:41:07,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@807b0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:41:07, skipping insertion in model container [2024-11-08 21:41:07,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:41:07" (3/3) ... [2024-11-08 21:41:07,505 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-11-08 21:41:07,542 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:41:07,542 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:41:07,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:41:07,622 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;@7c0eac09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:41:07,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:41:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 21:41:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 21:41:07,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:07,643 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:07,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:07,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:07,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1748067659, now seen corresponding path program 1 times [2024-11-08 21:41:07,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:07,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534947232] [2024-11-08 21:41:07,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:07,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:41:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:41:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:41:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:41:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:41:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:41:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:41:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:41:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:41:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:41:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:41:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:41:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:41:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:41:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:41:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:41:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:41:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:41:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:41:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:41:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 21:41:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:41:08,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:08,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534947232] [2024-11-08 21:41:08,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534947232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:08,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:08,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:41:08,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390241236] [2024-11-08 21:41:08,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:08,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:41:08,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:08,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:41:08,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:41:08,200 INFO L87 Difference]: Start difference. First operand has 90 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 21:41:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:08,234 INFO L93 Difference]: Finished difference Result 172 states and 300 transitions. [2024-11-08 21:41:08,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:41:08,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2024-11-08 21:41:08,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:08,248 INFO L225 Difference]: With dead ends: 172 [2024-11-08 21:41:08,248 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 21:41:08,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:41:08,257 INFO L432 NwaCegarLoop]: 131 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, 131 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-08 21:41:08,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:41:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 21:41:08,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-08 21:41:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 21:41:08,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 131 transitions. [2024-11-08 21:41:08,314 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 131 transitions. Word has length 171 [2024-11-08 21:41:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:08,315 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 131 transitions. [2024-11-08 21:41:08,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 21:41:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 131 transitions. [2024-11-08 21:41:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 21:41:08,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:08,319 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:08,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:41:08,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:08,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:08,321 INFO L85 PathProgramCache]: Analyzing trace with hash 641993791, now seen corresponding path program 1 times [2024-11-08 21:41:08,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:08,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381055377] [2024-11-08 21:41:08,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:08,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:41:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:41:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:41:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:41:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:41:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:41:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:41:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:41:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:41:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:41:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:41:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:41:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:41:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:41:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:41:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:41:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:41:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:41:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:41:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:41:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:08,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 21:41:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:41:09,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:09,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381055377] [2024-11-08 21:41:09,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381055377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:09,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:09,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:41:09,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364886849] [2024-11-08 21:41:09,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:09,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:41:09,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:09,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:41:09,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:41:09,010 INFO L87 Difference]: Start difference. First operand 85 states and 131 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:09,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:09,112 INFO L93 Difference]: Finished difference Result 249 states and 387 transitions. [2024-11-08 21:41:09,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:41:09,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-11-08 21:41:09,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:09,117 INFO L225 Difference]: With dead ends: 249 [2024-11-08 21:41:09,117 INFO L226 Difference]: Without dead ends: 167 [2024-11-08 21:41:09,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:09,119 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 72 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:09,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 368 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:41:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-08 21:41:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2024-11-08 21:41:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 21:41:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 252 transitions. [2024-11-08 21:41:09,156 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 252 transitions. Word has length 171 [2024-11-08 21:41:09,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:09,157 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 252 transitions. [2024-11-08 21:41:09,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 252 transitions. [2024-11-08 21:41:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 21:41:09,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:09,160 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:09,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:41:09,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:09,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1568213374, now seen corresponding path program 1 times [2024-11-08 21:41:09,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:09,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416207740] [2024-11-08 21:41:09,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:09,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:41:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:41:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:41:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:41:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:41:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:41:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:41:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:41:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:41:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:41:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:41:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:41:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:41:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:41:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:41:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:41:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:41:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:41:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:41:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:41:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 21:41:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:41:09,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:09,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416207740] [2024-11-08 21:41:09,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416207740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:09,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:09,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:41:09,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932635849] [2024-11-08 21:41:09,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:09,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:41:09,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:09,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:41:09,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:09,650 INFO L87 Difference]: Start difference. First operand 163 states and 252 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:09,879 INFO L93 Difference]: Finished difference Result 468 states and 718 transitions. [2024-11-08 21:41:09,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:41:09,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-08 21:41:09,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:09,890 INFO L225 Difference]: With dead ends: 468 [2024-11-08 21:41:09,891 INFO L226 Difference]: Without dead ends: 308 [2024-11-08 21:41:09,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:41:09,897 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 169 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:09,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 462 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:41:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-08 21:41:09,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 302. [2024-11-08 21:41:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 202 states have (on average 1.3465346534653466) internal successors, (272), 204 states have internal predecessors, (272), 94 states have call successors, (94), 5 states have call predecessors, (94), 5 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-08 21:41:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 460 transitions. [2024-11-08 21:41:09,971 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 460 transitions. Word has length 172 [2024-11-08 21:41:09,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:09,971 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 460 transitions. [2024-11-08 21:41:09,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:09,972 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 460 transitions. [2024-11-08 21:41:09,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 21:41:09,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:09,979 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:09,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:41:09,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:09,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:09,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1990915200, now seen corresponding path program 1 times [2024-11-08 21:41:09,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:09,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700474289] [2024-11-08 21:41:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:09,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:41:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:41:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:41:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:41:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:41:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:41:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:41:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:41:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:41:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:41:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:41:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:41:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:41:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:41:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:41:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:41:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:41:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:41:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:41:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:41:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 21:41:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:41:10,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:10,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700474289] [2024-11-08 21:41:10,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700474289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:10,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:10,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:41:10,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388207372] [2024-11-08 21:41:10,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:10,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:41:10,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:10,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:41:10,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:10,447 INFO L87 Difference]: Start difference. First operand 302 states and 460 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:10,723 INFO L93 Difference]: Finished difference Result 662 states and 1005 transitions. [2024-11-08 21:41:10,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:41:10,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-08 21:41:10,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:10,733 INFO L225 Difference]: With dead ends: 662 [2024-11-08 21:41:10,734 INFO L226 Difference]: Without dead ends: 502 [2024-11-08 21:41:10,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:41:10,738 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 123 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:10,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 519 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:41:10,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-08 21:41:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 358. [2024-11-08 21:41:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 260 states have internal predecessors, (365), 94 states have call successors, (94), 5 states have call predecessors, (94), 5 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-08 21:41:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 553 transitions. [2024-11-08 21:41:10,800 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 553 transitions. Word has length 172 [2024-11-08 21:41:10,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:10,802 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 553 transitions. [2024-11-08 21:41:10,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 553 transitions. [2024-11-08 21:41:10,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 21:41:10,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:10,809 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:10,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:41:10,810 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:10,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:10,810 INFO L85 PathProgramCache]: Analyzing trace with hash 185476866, now seen corresponding path program 1 times [2024-11-08 21:41:10,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:10,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249984755] [2024-11-08 21:41:10,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:10,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:41:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:41:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:41:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:41:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:41:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:41:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:41:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:41:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:41:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:41:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:41:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:41:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:41:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:41:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:41:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:41:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:41:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:41:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:41:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:41:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 21:41:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:41:11,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:11,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249984755] [2024-11-08 21:41:11,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249984755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:11,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:11,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:41:11,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388676491] [2024-11-08 21:41:11,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:11,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:41:11,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:11,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:41:11,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:41:11,136 INFO L87 Difference]: Start difference. First operand 358 states and 553 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:11,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:11,287 INFO L93 Difference]: Finished difference Result 624 states and 962 transitions. [2024-11-08 21:41:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:41:11,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-08 21:41:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:11,291 INFO L225 Difference]: With dead ends: 624 [2024-11-08 21:41:11,293 INFO L226 Difference]: Without dead ends: 360 [2024-11-08 21:41:11,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:41:11,296 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 129 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:11,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 180 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:41:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-08 21:41:11,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-11-08 21:41:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 260 states have (on average 1.4115384615384616) internal successors, (367), 262 states have internal predecessors, (367), 94 states have call successors, (94), 5 states have call predecessors, (94), 5 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-08 21:41:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 555 transitions. [2024-11-08 21:41:11,356 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 555 transitions. Word has length 172 [2024-11-08 21:41:11,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:11,357 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 555 transitions. [2024-11-08 21:41:11,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 555 transitions. [2024-11-08 21:41:11,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 21:41:11,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:11,361 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:11,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:41:11,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:11,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash -33904264, now seen corresponding path program 1 times [2024-11-08 21:41:11,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:11,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791539959] [2024-11-08 21:41:11,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:11,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:41:11,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [685077605] [2024-11-08 21:41:11,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:11,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:41:11,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:41:11,489 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-08 21:41:11,491 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-08 21:41:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:11,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:41:11,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:41:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 333 proven. 9 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2024-11-08 21:41:11,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:41:12,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:12,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791539959] [2024-11-08 21:41:12,209 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 21:41:12,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685077605] [2024-11-08 21:41:12,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685077605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:41:12,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 21:41:12,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-11-08 21:41:12,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738542970] [2024-11-08 21:41:12,210 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 21:41:12,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:41:12,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:12,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:41:12,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:41:12,212 INFO L87 Difference]: Start difference. First operand 360 states and 555 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 21:41:12,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:12,467 INFO L93 Difference]: Finished difference Result 656 states and 987 transitions. [2024-11-08 21:41:12,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 21:41:12,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2024-11-08 21:41:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:12,472 INFO L225 Difference]: With dead ends: 656 [2024-11-08 21:41:12,472 INFO L226 Difference]: Without dead ends: 376 [2024-11-08 21:41:12,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:41:12,474 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 72 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:12,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 223 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:41:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-08 21:41:12,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 360. [2024-11-08 21:41:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 257 states have (on average 1.3229571984435797) internal successors, (340), 259 states have internal predecessors, (340), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-08 21:41:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 528 transitions. [2024-11-08 21:41:12,517 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 528 transitions. Word has length 173 [2024-11-08 21:41:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:12,517 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 528 transitions. [2024-11-08 21:41:12,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 21:41:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 528 transitions. [2024-11-08 21:41:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 21:41:12,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:12,519 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:12,539 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-08 21:41:12,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 21:41:12,724 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:12,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:12,725 INFO L85 PathProgramCache]: Analyzing trace with hash -843250890, now seen corresponding path program 1 times [2024-11-08 21:41:12,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:12,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404625450] [2024-11-08 21:41:12,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:12,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:41:12,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [932572839] [2024-11-08 21:41:12,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:12,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:41:12,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:41:12,824 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-08 21:41:12,826 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-08 21:41:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:41:13,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:41:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:41:13,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:41:13,363 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:41:13,364 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:41:13,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 21:41:13,569 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,SelfDestructingSolverStorable6 [2024-11-08 21:41:13,572 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:13,713 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:41:13,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:41:13 BoogieIcfgContainer [2024-11-08 21:41:13,718 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:41:13,719 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:41:13,719 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:41:13,719 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:41:13,720 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:41:07" (3/4) ... [2024-11-08 21:41:13,722 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:41:13,723 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:41:13,723 INFO L158 Benchmark]: Toolchain (without parser) took 7374.47ms. Allocated memory was 144.7MB in the beginning and 211.8MB in the end (delta: 67.1MB). Free memory was 112.2MB in the beginning and 177.1MB in the end (delta: -65.0MB). Peak memory consumption was 1.0MB. Max. memory is 16.1GB. [2024-11-08 21:41:13,724 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 111.1MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:41:13,724 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.78ms. Allocated memory is still 144.7MB. Free memory was 112.2MB in the beginning and 94.5MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 21:41:13,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.53ms. Allocated memory is still 144.7MB. Free memory was 94.5MB in the beginning and 90.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:41:13,724 INFO L158 Benchmark]: Boogie Preprocessor took 82.58ms. Allocated memory is still 144.7MB. Free memory was 90.3MB in the beginning and 86.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:41:13,725 INFO L158 Benchmark]: RCFGBuilder took 608.68ms. Allocated memory is still 144.7MB. Free memory was 86.1MB in the beginning and 113.0MB in the end (delta: -26.9MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-11-08 21:41:13,725 INFO L158 Benchmark]: TraceAbstraction took 6222.50ms. Allocated memory was 144.7MB in the beginning and 211.8MB in the end (delta: 67.1MB). Free memory was 113.0MB in the beginning and 177.1MB in the end (delta: -64.1MB). Peak memory consumption was 122.5MB. Max. memory is 16.1GB. [2024-11-08 21:41:13,725 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 211.8MB. Free memory is still 177.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:41:13,727 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.76ms. Allocated memory is still 111.1MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.78ms. Allocated memory is still 144.7MB. Free memory was 112.2MB in the beginning and 94.5MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.53ms. Allocated memory is still 144.7MB. Free memory was 94.5MB in the beginning and 90.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.58ms. Allocated memory is still 144.7MB. Free memory was 90.3MB in the beginning and 86.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 608.68ms. Allocated memory is still 144.7MB. Free memory was 86.1MB in the beginning and 113.0MB in the end (delta: -26.9MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6222.50ms. Allocated memory was 144.7MB in the beginning and 211.8MB in the end (delta: 67.1MB). Free memory was 113.0MB in the beginning and 177.1MB in the end (delta: -64.1MB). Peak memory consumption was 122.5MB. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 211.8MB. Free memory is still 177.1MB. 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 177, overapproximation of shiftRight at line 67, overapproximation of someBinaryArithmeticFLOAToperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L42] signed short int var_1_23 = 128; [L43] unsigned short int var_1_25 = 32; [L44] unsigned char var_1_29 = 1; [L45] unsigned long int var_1_31 = 0; [L46] unsigned char var_1_32 = 1; [L47] unsigned short int var_1_33 = 1000; [L48] signed char var_1_38 = 25; [L49] unsigned short int var_1_39 = 200; [L50] unsigned char var_1_43 = 10; [L51] unsigned char var_1_47 = 0; VAL [isInitial=0, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=0, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] FCALL updateLastVariables() [L185] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L136] var_1_3 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L139] var_1_4 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L140] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L141] var_1_5 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L142] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L143] var_1_6 = __VERIFIER_nondet_float() [L144] 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, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L144] 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, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L145] var_1_7 = __VERIFIER_nondet_float() [L146] 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, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L146] 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, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L151] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L154] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L156] var_1_16 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L157] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L159] var_1_17 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L160] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L162] var_1_19 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L163] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L165] var_1_33 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L166] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] CALL assume_abort_if_not(var_1_33 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] RET assume_abort_if_not(var_1_33 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L169] var_1_39 = __VERIFIER_nondet_ushort() [L170] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L170] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_39 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] RET assume_abort_if_not(var_1_39 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_39 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] RET assume_abort_if_not(var_1_39 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L56] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L58] var_1_47 = var_1_11 [L59] var_1_20 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=-21474836464, var_1_8=1] [L60] COND TRUE var_1_11 >= var_1_21 [L61] var_1_31 = ((((var_1_21) > (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))))) ? (var_1_21) : (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=-21474836464, var_1_8=1] [L63] COND TRUE ((((var_1_21) < (var_1_33)) ? (var_1_21) : (var_1_33))) < (var_1_39 + var_1_11) [L64] var_1_43 = ((((var_1_11) < ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))))) ? (var_1_11) : ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L66] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L67] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L67] COND FALSE !((var_1_21 + var_1_12) > (2u >> var_1_11)) [L74] COND FALSE !(var_1_11 < var_1_11) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L79] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L90] unsigned char stepLocal_1 = var_1_14; [L91] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L92] COND TRUE var_1_14 || stepLocal_0 VAL [isInitial=1, stepLocal_1=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L93] COND TRUE stepLocal_1 || var_1_14 [L94] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=1] [L101] COND FALSE !(var_1_6 > (- var_1_7)) [L106] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] [L108] var_1_22 = var_1_8 [L109] var_1_23 = var_1_12 [L110] var_1_29 = var_1_19 VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] [L111] COND FALSE !(var_1_12 < (~ (var_1_12 / var_1_33))) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] [L120] COND FALSE !(var_1_12 < (var_1_12 / var_1_33)) [L123] var_1_32 = ((! var_1_19) && var_1_15) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] [L126] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] [L177-L178] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] [L19] reach_error() VAL [isInitial=1, var_1_10=-50, var_1_11=-21474836464, var_1_12=-21474836464, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-21474836464, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=15, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-21474836464, var_1_47=-21474836464, var_1_8=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 7, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 585 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 565 mSDsluCounter, 1883 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1051 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 472 IncrementalHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 832 mSDtfsCounter, 472 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 515 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=360occurred in iteration=5, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 170 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1550 NumberOfCodeBlocks, 1550 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1025 ConstructedInterpolants, 0 QuantifiedInterpolants, 1818 SizeOfPredicates, 2 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 7791/7800 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-08 21:41:13,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.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 b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:41:16,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:41:16,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:41:16,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:41:16,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:41:16,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:41:16,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:41:16,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:41:16,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:41:16,188 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:41:16,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:41:16,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:41:16,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:41:16,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:41:16,191 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:41:16,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:41:16,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:41:16,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:41:16,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:41:16,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:41:16,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:41:16,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:41:16,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:41:16,199 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:41:16,199 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:41:16,199 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:41:16,200 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:41:16,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:41:16,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:41:16,201 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:41:16,201 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:41:16,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:41:16,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:41:16,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:41:16,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:41:16,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:41:16,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:41:16,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:41:16,205 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:41:16,205 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:41:16,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:41:16,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:41:16,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:41:16,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:41:16,206 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 -> b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d [2024-11-08 21:41:16,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:41:16,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:41:16,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:41:16,538 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:41:16,539 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:41:16,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-11-08 21:41:18,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:41:18,435 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:41:18,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-11-08 21:41:18,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c5f2d6d/c8f96a3f25e14676b991acb628516043/FLAG09aad43d2 [2024-11-08 21:41:18,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c5f2d6d/c8f96a3f25e14676b991acb628516043 [2024-11-08 21:41:18,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:41:18,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:41:18,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:41:18,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:41:18,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:41:18,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392d5117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18, skipping insertion in model container [2024-11-08 21:41:18,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:41:18,723 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_fillercode_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2024-11-08 21:41:18,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:41:18,832 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:41:18,847 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_fillercode_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2024-11-08 21:41:18,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:41:18,911 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:41:18,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18 WrapperNode [2024-11-08 21:41:18,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:41:18,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:41:18,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:41:18,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:41:18,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,972 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-08 21:41:18,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:41:18,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:41:18,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:41:18,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:41:18,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:19,013 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-08 21:41:19,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:19,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:19,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:19,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:19,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:19,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:19,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:41:19,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:41:19,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:41:19,047 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:41:19,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:19,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:41:19,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:41:19,083 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-08 21:41:19,086 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-08 21:41:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:41:19,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:41:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:41:19,127 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:41:19,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:41:19,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:41:19,211 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:41:19,213 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:41:26,785 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 21:41:26,785 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:41:26,799 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:41:26,799 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:41:26,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:41:26 BoogieIcfgContainer [2024-11-08 21:41:26,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:41:26,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:41:26,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:41:26,805 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:41:26,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:41:18" (1/3) ... [2024-11-08 21:41:26,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acc263f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:41:26, skipping insertion in model container [2024-11-08 21:41:26,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (2/3) ... [2024-11-08 21:41:26,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acc263f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:41:26, skipping insertion in model container [2024-11-08 21:41:26,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:41:26" (3/3) ... [2024-11-08 21:41:26,808 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-11-08 21:41:26,825 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:41:26,826 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:41:26,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:41:26,909 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;@51e1f0bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:41:26,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:41:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 21:41:26,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 21:41:26,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:26,930 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:26,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:26,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1968945433, now seen corresponding path program 1 times [2024-11-08 21:41:26,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:41:26,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061108399] [2024-11-08 21:41:26,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:26,946 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-08 21:41:26,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:41:26,948 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-08 21:41:26,964 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-08 21:41:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:41:27,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:41:27,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-08 21:41:27,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:41:27,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:41:27,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061108399] [2024-11-08 21:41:27,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061108399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:27,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:27,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:41:27,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273253311] [2024-11-08 21:41:27,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:27,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:41:27,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:41:27,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:41:27,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:41:27,539 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 21:41:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:27,578 INFO L93 Difference]: Finished difference Result 156 states and 276 transitions. [2024-11-08 21:41:27,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:41:27,580 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2024-11-08 21:41:27,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:27,589 INFO L225 Difference]: With dead ends: 156 [2024-11-08 21:41:27,590 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 21:41:27,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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-08 21:41:27,599 INFO L432 NwaCegarLoop]: 114 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, 114 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-08 21:41:27,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:41:27,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 21:41:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-08 21:41:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 21:41:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2024-11-08 21:41:27,657 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 168 [2024-11-08 21:41:27,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:27,658 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2024-11-08 21:41:27,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 21:41:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2024-11-08 21:41:27,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 21:41:27,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:27,663 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:27,681 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-08 21:41:27,863 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-08 21:41:27,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:27,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:27,865 INFO L85 PathProgramCache]: Analyzing trace with hash -103688783, now seen corresponding path program 1 times [2024-11-08 21:41:27,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:41:27,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793171010] [2024-11-08 21:41:27,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:27,866 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-08 21:41:27,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:41:27,869 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-08 21:41:27,870 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-08 21:41:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:41:28,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:41:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 619 proven. 48 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2024-11-08 21:41:29,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:41:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:41:29,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:41:29,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793171010] [2024-11-08 21:41:29,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793171010] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 21:41:29,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 21:41:29,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-08 21:41:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694495438] [2024-11-08 21:41:29,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:29,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:41:29,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:41:29,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:41:29,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 21:41:29,587 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:32,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:41:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:32,853 INFO L93 Difference]: Finished difference Result 153 states and 228 transitions. [2024-11-08 21:41:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:41:32,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-08 21:41:32,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:32,859 INFO L225 Difference]: With dead ends: 153 [2024-11-08 21:41:32,859 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 21:41:32,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 21:41:32,861 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 59 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:32,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 148 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 21:41:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 21:41:32,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-08 21:41:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 21:41:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 116 transitions. [2024-11-08 21:41:32,878 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 116 transitions. Word has length 168 [2024-11-08 21:41:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:32,879 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 116 transitions. [2024-11-08 21:41:32,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 116 transitions. [2024-11-08 21:41:32,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 21:41:32,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:32,886 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:32,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 21:41:33,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:41:33,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:33,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:33,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2031867207, now seen corresponding path program 1 times [2024-11-08 21:41:33,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:41:33,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241182084] [2024-11-08 21:41:33,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:33,089 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-08 21:41:33,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:41:33,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:41:33,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 21:41:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:33,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 21:41:33,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:41:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:41:34,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:41:34,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:41:34,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241182084] [2024-11-08 21:41:34,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241182084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:34,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:34,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:41:34,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908842211] [2024-11-08 21:41:34,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:34,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:41:34,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:41:34,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:41:34,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:41:34,543 INFO L87 Difference]: Start difference. First operand 80 states and 116 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:38,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:41:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:38,219 INFO L93 Difference]: Finished difference Result 234 states and 342 transitions. [2024-11-08 21:41:38,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:41:38,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-11-08 21:41:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:38,261 INFO L225 Difference]: With dead ends: 234 [2024-11-08 21:41:38,263 INFO L226 Difference]: Without dead ends: 157 [2024-11-08 21:41:38,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:38,267 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 25 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:38,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 317 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 21:41:38,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-08 21:41:38,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2024-11-08 21:41:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 96 states have internal predecessors, (118), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 21:41:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 222 transitions. [2024-11-08 21:41:38,293 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 222 transitions. Word has length 169 [2024-11-08 21:41:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:38,294 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 222 transitions. [2024-11-08 21:41:38,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 222 transitions. [2024-11-08 21:41:38,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 21:41:38,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:38,297 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:38,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 21:41:38,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:41:38,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:38,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:38,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1242023999, now seen corresponding path program 1 times [2024-11-08 21:41:38,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:41:38,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44322470] [2024-11-08 21:41:38,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:38,500 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-08 21:41:38,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:41:38,504 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:41:38,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 21:41:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 21:41:38,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:41:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 46 proven. 576 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-08 21:41:43,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:41:44,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:41:44,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44322470] [2024-11-08 21:41:44,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44322470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:41:44,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1370309911] [2024-11-08 21:41:44,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:44,136 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 21:41:44,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 21:41:44,141 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 21:41:44,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-08 21:41:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:45,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 21:41:45,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:42:25,268 WARN L286 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)