./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf36b55c904ca2ccffa8ea0b31981733e9589bf81cd27298f5f87de592f2a0a7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:09:05,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:09:05,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:09:05,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:09:05,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:09:05,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:09:05,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:09:05,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:09:05,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:09:05,410 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:09:05,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:09:05,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:09:05,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:09:05,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:09:05,414 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:09:05,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:09:05,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:09:05,415 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:09:05,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:09:05,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:09:05,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:09:05,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:09:05,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:09:05,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:09:05,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:09:05,422 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:09:05,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:09:05,422 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:09:05,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:09:05,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:09:05,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:09:05,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:09:05,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:09:05,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:09:05,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:09:05,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:09:05,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:09:05,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:09:05,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:09:05,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:09:05,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:09:05,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:09:05,426 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf36b55c904ca2ccffa8ea0b31981733e9589bf81cd27298f5f87de592f2a0a7 [2024-11-20 08:09:05,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:09:05,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:09:05,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:09:05,703 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:09:05,703 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:09:05,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i [2024-11-20 08:09:07,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:09:07,421 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:09:07,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i [2024-11-20 08:09:07,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993118506/6ac22b2e539b42e0a2353209e4ab8f0e/FLAG9231ef02a [2024-11-20 08:09:07,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993118506/6ac22b2e539b42e0a2353209e4ab8f0e [2024-11-20 08:09:07,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:09:07,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:09:07,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:09:07,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:09:07,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:09:07,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:09:07" (1/1) ... [2024-11-20 08:09:07,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da1907c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:07, skipping insertion in model container [2024-11-20 08:09:07,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:09:07" (1/1) ... [2024-11-20 08:09:07,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:09:08,016 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i[915,928] [2024-11-20 08:09:08,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:09:08,086 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:09:08,096 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i[915,928] [2024-11-20 08:09:08,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:09:08,157 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:09:08,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:08 WrapperNode [2024-11-20 08:09:08,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:09:08,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:09:08,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:09:08,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:09:08,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:08" (1/1) ... [2024-11-20 08:09:08,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:08" (1/1) ... [2024-11-20 08:09:08,220 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-11-20 08:09:08,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:09:08,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:09:08,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:09:08,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:09:08,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:08" (1/1) ... [2024-11-20 08:09:08,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:08" (1/1) ... [2024-11-20 08:09:08,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:08" (1/1) ... [2024-11-20 08:09:08,257 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 08:09:08,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:08" (1/1) ... [2024-11-20 08:09:08,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:08" (1/1) ... [2024-11-20 08:09:08,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:08" (1/1) ... [2024-11-20 08:09:08,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:08" (1/1) ... [2024-11-20 08:09:08,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:08" (1/1) ... [2024-11-20 08:09:08,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:08" (1/1) ... [2024-11-20 08:09:08,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:09:08,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:09:08,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:09:08,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:09:08,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:08" (1/1) ... [2024-11-20 08:09:08,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:09:08,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:09:08,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:09:08,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:09:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:09:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:09:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:09:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:09:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:09:08,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:09:08,442 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:09:08,443 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:09:08,803 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 08:09:08,804 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:09:08,820 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:09:08,821 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:09:08,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:09:08 BoogieIcfgContainer [2024-11-20 08:09:08,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:09:08,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:09:08,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:09:08,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:09:08,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:09:07" (1/3) ... [2024-11-20 08:09:08,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b4553d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:09:08, skipping insertion in model container [2024-11-20 08:09:08,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:08" (2/3) ... [2024-11-20 08:09:08,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b4553d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:09:08, skipping insertion in model container [2024-11-20 08:09:08,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:09:08" (3/3) ... [2024-11-20 08:09:08,832 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-91.i [2024-11-20 08:09:08,848 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:09:08,849 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:09:08,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:09:08,913 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;@31644de1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:09:08,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:09:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:09:08,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-20 08:09:08,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:09:08,930 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:09:08,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:09:08,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:09:08,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2144689464, now seen corresponding path program 1 times [2024-11-20 08:09:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:09:08,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111516131] [2024-11-20 08:09:08,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:09:08,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:09:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:09:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:09:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:09:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:09:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:09:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:09:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:09:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:09:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:09:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:09:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:09:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:09:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 08:09:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:09:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 08:09:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 08:09:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:09:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:09:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 08:09:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:09:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:09:09,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:09:09,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111516131] [2024-11-20 08:09:09,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111516131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:09:09,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:09:09,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:09:09,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5059961] [2024-11-20 08:09:09,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:09:09,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:09:09,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:09:09,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:09:09,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:09:09,428 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:09:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:09:09,463 INFO L93 Difference]: Finished difference Result 119 states and 204 transitions. [2024-11-20 08:09:09,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:09:09,465 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-20 08:09:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:09:09,473 INFO L225 Difference]: With dead ends: 119 [2024-11-20 08:09:09,474 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 08:09:09,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:09:09,485 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:09:09,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:09:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 08:09:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-20 08:09:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:09:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2024-11-20 08:09:09,537 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 129 [2024-11-20 08:09:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:09:09,539 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2024-11-20 08:09:09,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:09:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2024-11-20 08:09:09,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-20 08:09:09,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:09:09,545 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:09:09,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:09:09,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:09:09,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:09:09,547 INFO L85 PathProgramCache]: Analyzing trace with hash -646869628, now seen corresponding path program 1 times [2024-11-20 08:09:09,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:09:09,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846318409] [2024-11-20 08:09:09,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:09:09,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:09:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:09:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:09:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:09:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:09:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:09:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:09:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:09:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:09:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:09:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:09:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:09:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:09:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 08:09:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:09:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 08:09:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 08:09:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:09:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 08:09:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 08:09:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 08:09:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:09:09,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:09:09,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846318409] [2024-11-20 08:09:09,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846318409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:09:09,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:09:09,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:09:09,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439029495] [2024-11-20 08:09:09,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:09:09,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:09:09,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:09:09,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:09:09,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:09:09,840 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:09:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:09:09,895 INFO L93 Difference]: Finished difference Result 167 states and 250 transitions. [2024-11-20 08:09:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:09:09,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-20 08:09:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:09:09,900 INFO L225 Difference]: With dead ends: 167 [2024-11-20 08:09:09,900 INFO L226 Difference]: Without dead ends: 111 [2024-11-20 08:09:09,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:09:09,903 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 76 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:09:09,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 231 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:09:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-20 08:09:09,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 61. [2024-11-20 08:09:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:09:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 90 transitions. [2024-11-20 08:09:09,921 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 90 transitions. Word has length 129 [2024-11-20 08:09:09,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:09:09,923 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 90 transitions. [2024-11-20 08:09:09,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:09:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 90 transitions. [2024-11-20 08:09:09,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-20 08:09:09,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:09:09,925 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:09:09,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:09:09,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:09:09,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:09:09,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1475379820, now seen corresponding path program 1 times [2024-11-20 08:09:09,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:09:09,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883276945] [2024-11-20 08:09:09,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:09:09,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:09:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 08:09:10,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081826179] [2024-11-20 08:09:10,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:09:10,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:09:10,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:09:10,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:09:10,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 08:09:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:09:10,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:09:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:09:10,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:09:10,620 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:09:10,622 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:09:10,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 08:09:10,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:09:10,827 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 08:09:10,932 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:09:10,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:09:10 BoogieIcfgContainer [2024-11-20 08:09:10,935 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:09:10,935 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:09:10,935 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:09:10,936 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:09:10,936 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:09:08" (3/4) ... [2024-11-20 08:09:10,938 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:09:10,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:09:10,939 INFO L158 Benchmark]: Toolchain (without parser) took 3153.04ms. Allocated memory was 172.0MB in the beginning and 232.8MB in the end (delta: 60.8MB). Free memory was 114.2MB in the beginning and 70.7MB in the end (delta: 43.5MB). Peak memory consumption was 106.3MB. Max. memory is 16.1GB. [2024-11-20 08:09:10,940 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 172.0MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:09:10,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.73ms. Allocated memory is still 172.0MB. Free memory was 114.2MB in the beginning and 98.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 08:09:10,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.73ms. Allocated memory is still 172.0MB. Free memory was 98.5MB in the beginning and 94.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:09:10,940 INFO L158 Benchmark]: Boogie Preprocessor took 81.23ms. Allocated memory is still 172.0MB. Free memory was 94.3MB in the beginning and 86.4MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-20 08:09:10,941 INFO L158 Benchmark]: RCFGBuilder took 517.48ms. Allocated memory was 172.0MB in the beginning and 232.8MB in the end (delta: 60.8MB). Free memory was 86.4MB in the beginning and 196.5MB in the end (delta: -110.1MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2024-11-20 08:09:10,941 INFO L158 Benchmark]: TraceAbstraction took 2111.12ms. Allocated memory is still 232.8MB. Free memory was 195.5MB in the beginning and 70.7MB in the end (delta: 124.8MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. [2024-11-20 08:09:10,941 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 232.8MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:09:10,943 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.13ms. Allocated memory is still 172.0MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.73ms. Allocated memory is still 172.0MB. Free memory was 114.2MB in the beginning and 98.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.73ms. Allocated memory is still 172.0MB. Free memory was 98.5MB in the beginning and 94.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.23ms. Allocated memory is still 172.0MB. Free memory was 94.3MB in the beginning and 86.4MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 517.48ms. Allocated memory was 172.0MB in the beginning and 232.8MB in the end (delta: 60.8MB). Free memory was 86.4MB in the beginning and 196.5MB in the end (delta: -110.1MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2111.12ms. Allocated memory is still 232.8MB. Free memory was 195.5MB in the beginning and 70.7MB in the end (delta: 124.8MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 232.8MB. Free memory is still 70.7MB. 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 133, overapproximation of someBinaryArithmeticFLOAToperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -64; [L23] signed short int var_1_5 = 8; [L24] signed short int var_1_6 = 8; [L25] signed short int var_1_7 = 5; [L26] signed short int var_1_8 = 0; [L27] signed char var_1_9 = 5; [L28] signed char var_1_11 = 16; [L29] signed short int var_1_12 = 25; [L30] signed short int var_1_13 = 64; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 16; [L33] float var_1_17 = 1.2; [L34] float var_1_18 = 5.8; [L35] float var_1_19 = 10.25; [L36] float var_1_20 = 2.5; [L37] signed short int var_1_21 = 200; [L38] unsigned char var_1_24 = 1; [L39] unsigned char var_1_25 = 0; [L40] signed char var_1_26 = -5; [L41] signed short int last_1_var_1_1 = -64; [L42] signed short int last_1_var_1_13 = 64; [L43] unsigned char last_1_var_1_15 = 1; [L44] signed char last_1_var_1_26 = -5; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L127] last_1_var_1_1 = var_1_1 [L128] last_1_var_1_13 = var_1_13 [L129] last_1_var_1_15 = var_1_15 [L130] last_1_var_1_26 = var_1_26 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L94] var_1_5 = __VERIFIER_nondet_short() [L95] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L95] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L96] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L96] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L97] var_1_6 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L98] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L99] CALL assume_abort_if_not(var_1_6 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L99] RET assume_abort_if_not(var_1_6 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L100] var_1_7 = __VERIFIER_nondet_short() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L102] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L102] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L103] var_1_8 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L104] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L105] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L105] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L106] var_1_11 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L107] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L108] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L108] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L109] var_1_12 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_12 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L110] RET assume_abort_if_not(var_1_12 >= -32768) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L111] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L111] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L112] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L112] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L113] var_1_16 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L114] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L115] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L115] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L116] var_1_18 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L117] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L118] var_1_19 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L119] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L120] var_1_20 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L121] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L122] var_1_25 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L123] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L124] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L124] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L141] RET updateVariables() [L142] CALL step() [L48] COND FALSE !(last_1_var_1_13 == last_1_var_1_1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L55] signed long int stepLocal_3 = (var_1_6 + var_1_8) - var_1_5; [L56] signed short int stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_2=-64, stepLocal_3=0, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L57] COND FALSE !(var_1_11 < stepLocal_2) [L64] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L66] COND TRUE var_1_11 < 5 [L67] var_1_17 = ((((var_1_18) > ((var_1_19 - var_1_20))) ? (var_1_18) : ((var_1_19 - var_1_20)))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L69] var_1_24 = var_1_25 [L70] var_1_26 = var_1_11 [L71] signed long int stepLocal_1 = var_1_1 * (var_1_15 % var_1_12); VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_1=0, stepLocal_3=0, var_1_11=-64, var_1_12=3, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=200, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L72] COND TRUE (- var_1_15) >= stepLocal_1 [L73] var_1_13 = var_1_26 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=3, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=200, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L75] COND FALSE !(\read(var_1_24)) [L80] var_1_21 = (var_1_15 - 2) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=3, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L82] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_0=0, stepLocal_3=0, var_1_11=-64, var_1_12=3, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L83] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_0=0, stepLocal_3=0, var_1_11=-64, var_1_12=3, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L86] COND TRUE stepLocal_0 <= (var_1_21 / var_1_12) [L87] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=3, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L142] RET step() [L143] CALL, EXPR property() [L133-L134] return ((((((((last_1_var_1_13 == last_1_var_1_1) ? ((last_1_var_1_1 <= ((((last_1_var_1_13) > (last_1_var_1_26)) ? (last_1_var_1_13) : (last_1_var_1_26)))) ? (var_1_1 == ((signed short int) (last_1_var_1_1 + (((((last_1_var_1_15 - last_1_var_1_15)) < ((last_1_var_1_15 - last_1_var_1_15))) ? ((last_1_var_1_15 - last_1_var_1_15)) : ((last_1_var_1_15 - last_1_var_1_15))))))) : (var_1_1 == ((signed short int) (((((last_1_var_1_15 - last_1_var_1_15)) < (((last_1_var_1_15 - last_1_var_1_15) + -256))) ? ((last_1_var_1_15 - last_1_var_1_15)) : (((last_1_var_1_15 - last_1_var_1_15) + -256))))))) : 1) && (var_1_24 ? (var_1_9 == ((signed char) var_1_11)) : ((var_1_15 <= (var_1_21 / var_1_12)) ? (var_1_9 == ((signed char) var_1_11)) : (var_1_9 == ((signed char) var_1_11))))) && (((- var_1_15) >= (var_1_1 * (var_1_15 % var_1_12))) ? (var_1_13 == ((signed short int) var_1_26)) : 1)) && ((var_1_11 < var_1_1) ? ((var_1_7 == ((var_1_6 + var_1_8) - var_1_5)) ? (var_1_15 == ((unsigned char) var_1_16)) : (var_1_15 == ((unsigned char) var_1_16))) : (var_1_15 == ((unsigned char) var_1_16)))) && ((var_1_11 < 5) ? (var_1_17 == ((float) ((((var_1_18) > ((var_1_19 - var_1_20))) ? (var_1_18) : ((var_1_19 - var_1_20)))))) : 1)) && (var_1_24 ? ((var_1_24 && var_1_24) ? (var_1_21 == ((signed short int) var_1_15)) : 1) : (var_1_21 == ((signed short int) (var_1_15 - 2))))) && (var_1_24 == ((unsigned char) var_1_25))) && (var_1_26 == ((signed char) var_1_11)) ; VAL [\result=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=3, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 319 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 242 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 50 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1520/1520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 08:09:10,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf36b55c904ca2ccffa8ea0b31981733e9589bf81cd27298f5f87de592f2a0a7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:09:13,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:09:13,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:09:13,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:09:13,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:09:13,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:09:13,316 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:09:13,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:09:13,317 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:09:13,318 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:09:13,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:09:13,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:09:13,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:09:13,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:09:13,322 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:09:13,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:09:13,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:09:13,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:09:13,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:09:13,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:09:13,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:09:13,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:09:13,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:09:13,327 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:09:13,327 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:09:13,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:09:13,328 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:09:13,328 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:09:13,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:09:13,329 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:09:13,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:09:13,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:09:13,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:09:13,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:09:13,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:09:13,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:09:13,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:09:13,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:09:13,335 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:09:13,351 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:09:13,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:09:13,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:09:13,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:09:13,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:09:13,355 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf36b55c904ca2ccffa8ea0b31981733e9589bf81cd27298f5f87de592f2a0a7 [2024-11-20 08:09:13,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:09:13,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:09:13,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:09:13,694 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:09:13,695 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:09:13,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i [2024-11-20 08:09:15,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:09:15,414 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:09:15,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i [2024-11-20 08:09:15,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fd799bb/e3f586172e854600859686a222fec044/FLAG7a1fd3031 [2024-11-20 08:09:15,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fd799bb/e3f586172e854600859686a222fec044 [2024-11-20 08:09:15,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:09:15,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:09:15,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:09:15,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:09:15,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:09:15,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:09:15" (1/1) ... [2024-11-20 08:09:15,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9a6dc0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:15, skipping insertion in model container [2024-11-20 08:09:15,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:09:15" (1/1) ... [2024-11-20 08:09:15,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:09:16,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i[915,928] [2024-11-20 08:09:16,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:09:16,105 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:09:16,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-91.i[915,928] [2024-11-20 08:09:16,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:09:16,190 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:09:16,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:16 WrapperNode [2024-11-20 08:09:16,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:09:16,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:09:16,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:09:16,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:09:16,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:16" (1/1) ... [2024-11-20 08:09:16,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:16" (1/1) ... [2024-11-20 08:09:16,245 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-20 08:09:16,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:09:16,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:09:16,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:09:16,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:09:16,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:16" (1/1) ... [2024-11-20 08:09:16,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:16" (1/1) ... [2024-11-20 08:09:16,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:16" (1/1) ... [2024-11-20 08:09:16,282 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 08:09:16,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:16" (1/1) ... [2024-11-20 08:09:16,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:16" (1/1) ... [2024-11-20 08:09:16,298 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:16" (1/1) ... [2024-11-20 08:09:16,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:16" (1/1) ... [2024-11-20 08:09:16,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:16" (1/1) ... [2024-11-20 08:09:16,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:16" (1/1) ... [2024-11-20 08:09:16,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:09:16,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:09:16,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:09:16,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:09:16,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:16" (1/1) ... [2024-11-20 08:09:16,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:09:16,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:09:16,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:09:16,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:09:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:09:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:09:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:09:16,399 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:09:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:09:16,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:09:16,473 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:09:16,475 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:09:17,048 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 08:09:17,048 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:09:17,066 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:09:17,066 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:09:17,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:09:17 BoogieIcfgContainer [2024-11-20 08:09:17,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:09:17,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:09:17,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:09:17,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:09:17,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:09:15" (1/3) ... [2024-11-20 08:09:17,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6113556a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:09:17, skipping insertion in model container [2024-11-20 08:09:17,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:16" (2/3) ... [2024-11-20 08:09:17,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6113556a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:09:17, skipping insertion in model container [2024-11-20 08:09:17,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:09:17" (3/3) ... [2024-11-20 08:09:17,077 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-91.i [2024-11-20 08:09:17,098 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:09:17,099 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:09:17,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:09:17,168 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;@7d008695, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:09:17,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:09:17,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:09:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-20 08:09:17,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:09:17,185 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:09:17,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:09:17,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:09:17,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2144689464, now seen corresponding path program 1 times [2024-11-20 08:09:17,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:09:17,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791282631] [2024-11-20 08:09:17,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:09:17,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:09:17,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:09:17,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:09:17,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 08:09:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:17,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 08:09:17,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:09:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-20 08:09:17,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:09:17,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:09:17,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791282631] [2024-11-20 08:09:17,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791282631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:09:17,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:09:17,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:09:17,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693401337] [2024-11-20 08:09:17,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:09:17,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:09:17,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:09:17,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:09:17,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:09:17,577 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:09:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:09:17,600 INFO L93 Difference]: Finished difference Result 119 states and 204 transitions. [2024-11-20 08:09:17,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:09:17,604 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-20 08:09:17,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:09:17,610 INFO L225 Difference]: With dead ends: 119 [2024-11-20 08:09:17,610 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 08:09:17,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:09:17,616 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:09:17,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:09:17,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 08:09:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-20 08:09:17,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:09:17,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2024-11-20 08:09:17,654 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 129 [2024-11-20 08:09:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:09:17,654 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2024-11-20 08:09:17,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:09:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2024-11-20 08:09:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-20 08:09:17,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:09:17,659 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:09:17,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 08:09:17,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:09:17,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:09:17,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:09:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash -646869628, now seen corresponding path program 1 times [2024-11-20 08:09:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:09:17,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568616945] [2024-11-20 08:09:17,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:09:17,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:09:17,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:09:17,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:09:17,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 08:09:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:18,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 08:09:18,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:09:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-20 08:09:18,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:09:18,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:09:18,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568616945] [2024-11-20 08:09:18,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568616945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:09:18,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:09:18,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 08:09:18,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055276303] [2024-11-20 08:09:18,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:09:18,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 08:09:18,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:09:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 08:09:18,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 08:09:18,283 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:09:19,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:09:19,237 INFO L93 Difference]: Finished difference Result 174 states and 253 transitions. [2024-11-20 08:09:19,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 08:09:19,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-20 08:09:19,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:09:19,248 INFO L225 Difference]: With dead ends: 174 [2024-11-20 08:09:19,248 INFO L226 Difference]: Without dead ends: 118 [2024-11-20 08:09:19,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:09:19,250 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 101 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:09:19,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 279 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 08:09:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-20 08:09:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 62. [2024-11-20 08:09:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:09:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2024-11-20 08:09:19,274 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 129 [2024-11-20 08:09:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:09:19,275 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2024-11-20 08:09:19,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:09:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2024-11-20 08:09:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-20 08:09:19,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:09:19,278 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:09:19,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 08:09:19,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:09:19,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:09:19,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:09:19,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1475379820, now seen corresponding path program 1 times [2024-11-20 08:09:19,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:09:19,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455308167] [2024-11-20 08:09:19,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:09:19,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 08:09:19,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:09:19,483 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 08:09:19,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 08:09:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:19,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-20 08:09:19,780 INFO L278 TraceCheckSpWp]: Computing forward predicates...