./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-83.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8fde2e0ff620a40080e503c7a3f660bc2cd4630a73841f8ba1f9b25a52fdc475 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:48:55,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:48:55,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:48:55,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:48:55,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:48:55,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:48:55,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:48:55,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:48:55,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:48:55,376 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:48:55,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:48:55,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:48:55,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:48:55,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:48:55,381 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:48:55,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:48:55,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:48:55,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:48:55,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:48:55,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:48:55,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:48:55,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:48:55,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:48:55,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:48:55,385 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:48:55,385 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:48:55,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:48:55,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:48:55,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:48:55,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:48:55,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:48:55,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:48:55,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:48:55,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:48:55,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:48:55,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:48:55,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:48:55,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:48:55,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:48:55,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:48:55,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:48:55,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:48:55,390 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-clean/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-clean/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 -> 8fde2e0ff620a40080e503c7a3f660bc2cd4630a73841f8ba1f9b25a52fdc475 [2024-10-11 07:48:55,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:48:55,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:48:55,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:48:55,676 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:48:55,676 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:48:55,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-83.i [2024-10-11 07:48:57,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:48:57,284 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:48:57,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-83.i [2024-10-11 07:48:57,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2d0fcdd91/8e5eba34937449c384310685973f46cf/FLAG3bcdefa93 [2024-10-11 07:48:57,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2d0fcdd91/8e5eba34937449c384310685973f46cf [2024-10-11 07:48:57,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:48:57,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:48:57,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:48:57,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:48:57,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:48:57,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:48:57" (1/1) ... [2024-10-11 07:48:57,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c30693f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:57, skipping insertion in model container [2024-10-11 07:48:57,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:48:57" (1/1) ... [2024-10-11 07:48:57,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:48:57,525 WARN L248 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_fillercodesize_normal_file-83.i[913,926] [2024-10-11 07:48:57,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:48:57,625 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:48:57,638 WARN L248 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_fillercodesize_normal_file-83.i[913,926] [2024-10-11 07:48:57,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:48:57,699 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:48:57,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:57 WrapperNode [2024-10-11 07:48:57,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:48:57,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:48:57,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:48:57,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:48:57,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:57" (1/1) ... [2024-10-11 07:48:57,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:57" (1/1) ... [2024-10-11 07:48:57,766 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-10-11 07:48:57,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:48:57,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:48:57,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:48:57,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:48:57,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:57" (1/1) ... [2024-10-11 07:48:57,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:57" (1/1) ... [2024-10-11 07:48:57,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:57" (1/1) ... [2024-10-11 07:48:57,813 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-10-11 07:48:57,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:57" (1/1) ... [2024-10-11 07:48:57,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:57" (1/1) ... [2024-10-11 07:48:57,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:57" (1/1) ... [2024-10-11 07:48:57,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:57" (1/1) ... [2024-10-11 07:48:57,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:57" (1/1) ... [2024-10-11 07:48:57,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:57" (1/1) ... [2024-10-11 07:48:57,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:48:57,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:48:57,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:48:57,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:48:57,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:57" (1/1) ... [2024-10-11 07:48:57,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:48:57,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:48:57,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:48:57,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:48:57,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:48:57,938 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:48:57,938 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:48:57,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:48:57,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:48:57,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:48:58,028 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:48:58,030 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:48:58,559 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 07:48:58,559 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:48:58,599 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:48:58,601 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:48:58,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:48:58 BoogieIcfgContainer [2024-10-11 07:48:58,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:48:58,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:48:58,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:48:58,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:48:58,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:48:57" (1/3) ... [2024-10-11 07:48:58,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cc5c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:48:58, skipping insertion in model container [2024-10-11 07:48:58,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:57" (2/3) ... [2024-10-11 07:48:58,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cc5c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:48:58, skipping insertion in model container [2024-10-11 07:48:58,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:48:58" (3/3) ... [2024-10-11 07:48:58,611 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-83.i [2024-10-11 07:48:58,627 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:48:58,627 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:48:58,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:48:58,695 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;@450401da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:48:58,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:48:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 50 states have (on average 1.52) internal successors, (76), 51 states have internal predecessors, (76), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 07:48:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 07:48:58,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:48:58,713 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:48:58,713 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:48:58,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:48:58,719 INFO L85 PathProgramCache]: Analyzing trace with hash -271155343, now seen corresponding path program 1 times [2024-10-11 07:48:58,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:48:58,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240675461] [2024-10-11 07:48:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:48:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:48:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:58,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:48:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:48:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:48:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:48:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:48:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:48:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:48:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:48:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:48:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:48:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:48:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:48:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:48:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:48:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:48:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:48:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:48:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:48:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:48:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 07:48:59,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:48:59,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240675461] [2024-10-11 07:48:59,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240675461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:48:59,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:48:59,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:48:59,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545698284] [2024-10-11 07:48:59,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:48:59,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:48:59,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:48:59,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:48:59,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:48:59,155 INFO L87 Difference]: Start difference. First operand has 72 states, 50 states have (on average 1.52) internal successors, (76), 51 states have internal predecessors, (76), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 07:48:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:48:59,198 INFO L93 Difference]: Finished difference Result 141 states and 245 transitions. [2024-10-11 07:48:59,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:48:59,202 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2024-10-11 07:48:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:48:59,210 INFO L225 Difference]: With dead ends: 141 [2024-10-11 07:48:59,211 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 07:48:59,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-10-11 07:48:59,219 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:48:59,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:48:59,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 07:48:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-11 07:48:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 49 states have internal predecessors, (71), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 07:48:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 109 transitions. [2024-10-11 07:48:59,271 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 109 transitions. Word has length 120 [2024-10-11 07:48:59,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:48:59,273 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 109 transitions. [2024-10-11 07:48:59,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 07:48:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 109 transitions. [2024-10-11 07:48:59,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 07:48:59,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:48:59,278 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:48:59,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:48:59,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:48:59,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:48:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash -549658121, now seen corresponding path program 1 times [2024-10-11 07:48:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:48:59,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246472496] [2024-10-11 07:48:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:48:59,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:48:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:49:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:49:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:49:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:49:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:49:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:49:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:49:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:49:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:49:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:49:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 108 proven. 102 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2024-10-11 07:49:00,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:00,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246472496] [2024-10-11 07:49:00,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246472496] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:49:00,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863535444] [2024-10-11 07:49:00,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:00,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:49:00,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:49:00,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:49:00,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:49:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:00,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 07:49:00,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:49:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 473 proven. 102 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-10-11 07:49:02,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:49:06,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863535444] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:49:06,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:49:06,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 22 [2024-10-11 07:49:06,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599457273] [2024-10-11 07:49:06,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:49:06,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 07:49:06,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:06,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 07:49:06,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2024-10-11 07:49:06,295 INFO L87 Difference]: Start difference. First operand 70 states and 109 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 9 states have call successors, (31), 6 states have call predecessors, (31), 10 states have return successors, (31), 9 states have call predecessors, (31), 9 states have call successors, (31) [2024-10-11 07:49:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:07,271 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2024-10-11 07:49:07,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 07:49:07,272 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 9 states have call successors, (31), 6 states have call predecessors, (31), 10 states have return successors, (31), 9 states have call predecessors, (31), 9 states have call successors, (31) Word has length 120 [2024-10-11 07:49:07,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:07,275 INFO L225 Difference]: With dead ends: 167 [2024-10-11 07:49:07,275 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 07:49:07,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=691, Invalid=1961, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 07:49:07,290 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 423 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:07,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 234 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 07:49:07,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 07:49:07,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2024-10-11 07:49:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 07:49:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2024-10-11 07:49:07,319 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 120 [2024-10-11 07:49:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:07,320 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2024-10-11 07:49:07,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 9 states have call successors, (31), 6 states have call predecessors, (31), 10 states have return successors, (31), 9 states have call predecessors, (31), 9 states have call successors, (31) [2024-10-11 07:49:07,321 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2024-10-11 07:49:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 07:49:07,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:07,324 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:49:07,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 07:49:07,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:49:07,529 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:07,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:07,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1990606481, now seen corresponding path program 1 times [2024-10-11 07:49:07,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:07,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037942890] [2024-10-11 07:49:07,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:07,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:49:07,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [766960897] [2024-10-11 07:49:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:07,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:49:07,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:49:07,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:49:07,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 07:49:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:49:07,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:49:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:49:07,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:49:07,828 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:49:07,829 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:49:07,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 07:49:08,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:49:08,038 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 07:49:08,137 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:49:08,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:49:08 BoogieIcfgContainer [2024-10-11 07:49:08,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:49:08,147 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:49:08,147 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:49:08,147 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:49:08,148 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:48:58" (3/4) ... [2024-10-11 07:49:08,150 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:49:08,151 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:49:08,151 INFO L158 Benchmark]: Toolchain (without parser) took 10836.76ms. Allocated memory was 157.3MB in the beginning and 281.0MB in the end (delta: 123.7MB). Free memory was 122.5MB in the beginning and 200.8MB in the end (delta: -78.3MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2024-10-11 07:49:08,152 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory was 76.0MB in the beginning and 75.9MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:49:08,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.44ms. Allocated memory is still 157.3MB. Free memory was 121.9MB in the beginning and 106.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 07:49:08,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.47ms. Allocated memory is still 157.3MB. Free memory was 106.6MB in the beginning and 101.5MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 07:49:08,153 INFO L158 Benchmark]: Boogie Preprocessor took 83.90ms. Allocated memory is still 157.3MB. Free memory was 100.9MB in the beginning and 94.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 07:49:08,153 INFO L158 Benchmark]: RCFGBuilder took 749.48ms. Allocated memory is still 157.3MB. Free memory was 94.1MB in the beginning and 102.3MB in the end (delta: -8.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 07:49:08,153 INFO L158 Benchmark]: TraceAbstraction took 9542.45ms. Allocated memory was 157.3MB in the beginning and 281.0MB in the end (delta: 123.7MB). Free memory was 102.3MB in the beginning and 200.8MB in the end (delta: -98.4MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2024-10-11 07:49:08,154 INFO L158 Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 281.0MB. Free memory is still 200.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:49:08,158 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.15ms. Allocated memory is still 104.9MB. Free memory was 76.0MB in the beginning and 75.9MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.44ms. Allocated memory is still 157.3MB. Free memory was 121.9MB in the beginning and 106.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.47ms. Allocated memory is still 157.3MB. Free memory was 106.6MB in the beginning and 101.5MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.90ms. Allocated memory is still 157.3MB. Free memory was 100.9MB in the beginning and 94.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 749.48ms. Allocated memory is still 157.3MB. Free memory was 94.1MB in the beginning and 102.3MB in the end (delta: -8.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9542.45ms. Allocated memory was 157.3MB in the beginning and 281.0MB in the end (delta: 123.7MB). Free memory was 102.3MB in the beginning and 200.8MB in the end (delta: -98.4MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Witness Printer took 4.25ms. Allocated memory is still 281.0MB. Free memory is still 200.8MB. 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 106, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -25; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1230640054; [L25] signed long int var_1_6 = 1508873667; [L26] unsigned char var_1_7 = 64; [L27] unsigned char var_1_8 = 200; [L28] unsigned char var_1_9 = 16; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_11 = 8; [L31] float var_1_12 = 15.4; [L32] float var_1_16 = 10000000000000.375; [L33] float var_1_17 = 16.4; [L34] float var_1_18 = 8.5; [L35] float var_1_19 = 64.75; [L36] unsigned char var_1_20 = 16; [L37] signed char var_1_22 = 0; [L38] unsigned char var_1_23 = 16; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] FCALL updateLastVariables() [L114] CALL updateVariables() [L73] var_1_2 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L74] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L75] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L75] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L76] var_1_3 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L77] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L78] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L78] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L79] var_1_6 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_6 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L80] RET assume_abort_if_not(var_1_6 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L81] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L81] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L82] var_1_8 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_8 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L83] RET assume_abort_if_not(var_1_8 >= 190) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L84] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L84] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L85] var_1_9 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190] [L86] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190] [L87] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L87] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L88] var_1_10 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L89] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_10 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L90] RET assume_abort_if_not(var_1_10 <= 32) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L91] var_1_11 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L92] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_11 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L93] RET assume_abort_if_not(var_1_11 <= 31) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L94] var_1_17 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L95] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L96] var_1_18 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L97] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L98] var_1_20 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_20 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L99] RET assume_abort_if_not(var_1_20 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L100] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L101] CALL assume_abort_if_not(var_1_20 != 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L101] RET assume_abort_if_not(var_1_20 != 127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L114] RET updateVariables() [L115] CALL step() [L42] var_1_7 = ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11))) [L43] var_1_16 = (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L44] COND FALSE !((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) [L51] var_1_23 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L53] COND TRUE \read(var_1_2) [L54] var_1_1 = ((var_1_3 - var_1_7) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L58] signed long int stepLocal_1 = var_1_9 % (var_1_8 - var_1_20); VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L59] EXPR var_1_7 ^ var_1_10 VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L59] signed long int stepLocal_0 = var_1_7 ^ var_1_10; [L60] COND FALSE !(stepLocal_1 > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) VAL [isInitial=1, stepLocal_0=90, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L65] COND TRUE (var_1_11 % var_1_20) < var_1_1 [L66] var_1_22 = ((((10) > (var_1_10)) ? (10) : (var_1_10))) VAL [isInitial=1, stepLocal_0=90, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L68] COND TRUE ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f)) [L69] var_1_12 = 31.5f VAL [isInitial=1, stepLocal_0=90, var_1_10=0, var_1_11=0, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR ((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L106-L107] return ((((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1)) && (((var_1_11 % var_1_20) < var_1_1) ? (var_1_22 == ((signed char) ((((10) > (var_1_10)) ? (10) : (var_1_10))))) : 1)) && (((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) ? ((var_1_10 > var_1_7) ? (var_1_23 == ((unsigned char) ((((var_1_20) < ((var_1_8 - var_1_9))) ? (var_1_20) : ((var_1_8 - var_1_9)))))) : (var_1_23 == ((unsigned char) (((((var_1_20) > (64)) ? (var_1_20) : (64))) + var_1_11)))) : (var_1_23 == ((unsigned char) var_1_20))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 424 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 423 mSDsluCounter, 340 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 164 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 270 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=2, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 602 NumberOfCodeBlocks, 602 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 357 ConstructedInterpolants, 0 QuantifiedInterpolants, 3058 SizeOfPredicates, 5 NumberOfNonLiveVariables, 272 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1848/2052 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-10-11 07:49:08,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-83.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8fde2e0ff620a40080e503c7a3f660bc2cd4630a73841f8ba1f9b25a52fdc475 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:49:10,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:49:10,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:49:10,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:49:10,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:49:10,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:49:10,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:49:10,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:49:10,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:49:10,643 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:49:10,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:49:10,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:49:10,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:49:10,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:49:10,646 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:49:10,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:49:10,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:49:10,647 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:49:10,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:49:10,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:49:10,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:49:10,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:49:10,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:49:10,649 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:49:10,649 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:49:10,650 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:49:10,650 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:49:10,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:49:10,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:49:10,651 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:49:10,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:49:10,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:49:10,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:49:10,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:49:10,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:49:10,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:49:10,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:49:10,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:49:10,659 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:49:10,659 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:49:10,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:49:10,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:49:10,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:49:10,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:49:10,662 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:49:10,662 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-clean/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-clean/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 -> 8fde2e0ff620a40080e503c7a3f660bc2cd4630a73841f8ba1f9b25a52fdc475 [2024-10-11 07:49:10,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:49:11,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:49:11,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:49:11,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:49:11,023 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:49:11,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-83.i [2024-10-11 07:49:12,593 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:49:12,856 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:49:12,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-83.i [2024-10-11 07:49:12,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/773e9e22c/4b01af46d2944d989cc37844779d1386/FLAGa0b14c180 [2024-10-11 07:49:12,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/773e9e22c/4b01af46d2944d989cc37844779d1386 [2024-10-11 07:49:12,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:49:12,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:49:12,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:49:12,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:49:12,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:49:12,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:49:12" (1/1) ... [2024-10-11 07:49:12,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@429573ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:12, skipping insertion in model container [2024-10-11 07:49:12,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:49:12" (1/1) ... [2024-10-11 07:49:12,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:49:13,146 WARN L248 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_fillercodesize_normal_file-83.i[913,926] [2024-10-11 07:49:13,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:49:13,240 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:49:13,251 WARN L248 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_fillercodesize_normal_file-83.i[913,926] [2024-10-11 07:49:13,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:49:13,303 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:49:13,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:13 WrapperNode [2024-10-11 07:49:13,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:49:13,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:49:13,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:49:13,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:49:13,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:13" (1/1) ... [2024-10-11 07:49:13,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:13" (1/1) ... [2024-10-11 07:49:13,358 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-10-11 07:49:13,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:49:13,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:49:13,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:49:13,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:49:13,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:13" (1/1) ... [2024-10-11 07:49:13,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:13" (1/1) ... [2024-10-11 07:49:13,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:13" (1/1) ... [2024-10-11 07:49:13,395 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-10-11 07:49:13,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:13" (1/1) ... [2024-10-11 07:49:13,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:13" (1/1) ... [2024-10-11 07:49:13,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:13" (1/1) ... [2024-10-11 07:49:13,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:13" (1/1) ... [2024-10-11 07:49:13,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:13" (1/1) ... [2024-10-11 07:49:13,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:13" (1/1) ... [2024-10-11 07:49:13,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:49:13,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:49:13,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:49:13,423 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:49:13,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:13" (1/1) ... [2024-10-11 07:49:13,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:49:13,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:49:13,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:49:13,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:49:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:49:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:49:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:49:13,499 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:49:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:49:13,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:49:13,589 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:49:13,591 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:49:15,735 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 07:49:15,735 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:49:15,791 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:49:15,792 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:49:15,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:49:15 BoogieIcfgContainer [2024-10-11 07:49:15,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:49:15,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:49:15,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:49:15,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:49:15,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:49:12" (1/3) ... [2024-10-11 07:49:15,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e78cc78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:49:15, skipping insertion in model container [2024-10-11 07:49:15,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:49:13" (2/3) ... [2024-10-11 07:49:15,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e78cc78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:49:15, skipping insertion in model container [2024-10-11 07:49:15,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:49:15" (3/3) ... [2024-10-11 07:49:15,803 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-83.i [2024-10-11 07:49:15,817 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:49:15,818 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:49:15,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:49:15,885 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;@69afac69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:49:15,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:49:15,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 07:49:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 07:49:15,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:15,904 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:49:15,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:15,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:15,911 INFO L85 PathProgramCache]: Analyzing trace with hash -836101274, now seen corresponding path program 1 times [2024-10-11 07:49:15,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:49:15,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141130129] [2024-10-11 07:49:15,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:15,927 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-10-11 07:49:15,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:49:15,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 07:49:15,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:49:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:16,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:49:16,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:49:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-11 07:49:16,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:49:16,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:49:16,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141130129] [2024-10-11 07:49:16,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141130129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:16,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:16,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:49:16,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282423664] [2024-10-11 07:49:16,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:16,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:49:16,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:49:16,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:49:16,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:49:16,539 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 07:49:16,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:16,986 INFO L93 Difference]: Finished difference Result 97 states and 173 transitions. [2024-10-11 07:49:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:49:17,010 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2024-10-11 07:49:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:17,017 INFO L225 Difference]: With dead ends: 97 [2024-10-11 07:49:17,017 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 07:49:17,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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-10-11 07:49:17,023 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:17,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 07:49:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 07:49:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 07:49:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 07:49:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 73 transitions. [2024-10-11 07:49:17,073 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 73 transitions. Word has length 116 [2024-10-11 07:49:17,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:17,073 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 73 transitions. [2024-10-11 07:49:17,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 07:49:17,074 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 73 transitions. [2024-10-11 07:49:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 07:49:17,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:17,077 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:49:17,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:49:17,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 07:49:17,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:17,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:17,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1854058732, now seen corresponding path program 1 times [2024-10-11 07:49:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:49:17,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530355162] [2024-10-11 07:49:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:17,284 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-10-11 07:49:17,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:49:17,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 07:49:17,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:49:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:17,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 07:49:17,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:49:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 498 proven. 117 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-11 07:49:36,790 INFO L311 TraceCheckSpWp]: Computing backward predicates...