./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.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 758300177d1b355ef883590ed584633de094bad912a987cbd68951ea58e51ff9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:09:52,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:09:53,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:09:53,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:09:53,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:09:53,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:09:53,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:09:53,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:09:53,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:09:53,041 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:09:53,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:09:53,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:09:53,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:09:53,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:09:53,044 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:09:53,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:09:53,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:09:53,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:09:53,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:09:53,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:09:53,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:09:53,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:09:53,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:09:53,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:09:53,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:09:53,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:09:53,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:09:53,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:09:53,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:09:53,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:09:53,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:09:53,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:09:53,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:09:53,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:09:53,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:09:53,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:09:53,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:09:53,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:09:53,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:09:53,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:09:53,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:09:53,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:09:53,052 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 -> 758300177d1b355ef883590ed584633de094bad912a987cbd68951ea58e51ff9 [2024-11-12 01:09:53,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:09:53,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:09:53,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:09:53,317 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:09:53,320 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:09:53,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i [2024-11-12 01:09:54,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:09:54,879 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:09:54,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i [2024-11-12 01:09:54,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f275fc3c/e89969e48dbb40b9aced3e2f8e9dc81a/FLAG239e2a77d [2024-11-12 01:09:54,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f275fc3c/e89969e48dbb40b9aced3e2f8e9dc81a [2024-11-12 01:09:54,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:09:54,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:09:54,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:09:54,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:09:54,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:09:54,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:09:54" (1/1) ... [2024-11-12 01:09:54,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44dde34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:09:54, skipping insertion in model container [2024-11-12 01:09:54,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:09:54" (1/1) ... [2024-11-12 01:09:54,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:09:55,094 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_codestructure_functionizing_file-6.i[919,932] [2024-11-12 01:09:55,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:09:55,154 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:09:55,168 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_codestructure_functionizing_file-6.i[919,932] [2024-11-12 01:09:55,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:09:55,203 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:09:55,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:09:55 WrapperNode [2024-11-12 01:09:55,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:09:55,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:09:55,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:09:55,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:09:55,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:09:55" (1/1) ... [2024-11-12 01:09:55,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:09:55" (1/1) ... [2024-11-12 01:09:55,300 INFO L138 Inliner]: procedures = 31, calls = 37, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 152 [2024-11-12 01:09:55,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:09:55,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:09:55,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:09:55,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:09:55,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:09:55" (1/1) ... [2024-11-12 01:09:55,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:09:55" (1/1) ... [2024-11-12 01:09:55,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:09:55" (1/1) ... [2024-11-12 01:09:55,370 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-12 01:09:55,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:09:55" (1/1) ... [2024-11-12 01:09:55,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:09:55" (1/1) ... [2024-11-12 01:09:55,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:09:55" (1/1) ... [2024-11-12 01:09:55,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:09:55" (1/1) ... [2024-11-12 01:09:55,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:09:55" (1/1) ... [2024-11-12 01:09:55,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:09:55" (1/1) ... [2024-11-12 01:09:55,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:09:55,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:09:55,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:09:55,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:09:55,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:09:55" (1/1) ... [2024-11-12 01:09:55,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:09:55,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:09:55,445 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-12 01:09:55,451 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-12 01:09:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:09:55,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:09:55,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:09:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:09:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:09:55,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:09:55,569 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:09:55,571 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:09:55,858 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-12 01:09:55,859 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:09:55,868 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:09:55,869 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:09:55,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:09:55 BoogieIcfgContainer [2024-11-12 01:09:55,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:09:55,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:09:55,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:09:55,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:09:55,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:09:54" (1/3) ... [2024-11-12 01:09:55,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bcf272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:09:55, skipping insertion in model container [2024-11-12 01:09:55,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:09:55" (2/3) ... [2024-11-12 01:09:55,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bcf272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:09:55, skipping insertion in model container [2024-11-12 01:09:55,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:09:55" (3/3) ... [2024-11-12 01:09:55,877 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-6.i [2024-11-12 01:09:55,891 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:09:55,892 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:09:55,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:09:55,959 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;@4aa51d84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:09:55,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:09:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 01:09:55,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-12 01:09:55,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:09:55,972 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:09:55,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:09:55,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:09:55,977 INFO L85 PathProgramCache]: Analyzing trace with hash -812521492, now seen corresponding path program 1 times [2024-11-12 01:09:55,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:09:55,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572365194] [2024-11-12 01:09:55,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:09:55,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:09:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:09:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:09:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:09:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:09:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:09:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:09:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:09:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 01:09:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 01:09:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 01:09:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 01:09:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 01:09:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 01:09:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 01:09:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 01:09:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 01:09:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 01:09:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 01:09:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 01:09:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 01:09:56,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:09:56,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572365194] [2024-11-12 01:09:56,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572365194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:09:56,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:09:56,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:09:56,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772528255] [2024-11-12 01:09:56,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:09:56,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:09:56,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:09:56,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:09:56,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:09:56,278 INFO L87 Difference]: Start difference. First operand has 65 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 01:09:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:09:56,352 INFO L93 Difference]: Finished difference Result 123 states and 203 transitions. [2024-11-12 01:09:56,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:09:56,359 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2024-11-12 01:09:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:09:56,369 INFO L225 Difference]: With dead ends: 123 [2024-11-12 01:09:56,369 INFO L226 Difference]: Without dead ends: 61 [2024-11-12 01:09:56,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:09:56,380 INFO L435 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-12 01:09:56,384 INFO L436 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-12 01:09:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-12 01:09:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-12 01:09:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 01:09:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2024-11-12 01:09:56,454 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 126 [2024-11-12 01:09:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:09:56,455 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2024-11-12 01:09:56,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 01:09:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2024-11-12 01:09:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-12 01:09:56,464 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:09:56,465 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:09:56,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:09:56,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:09:56,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:09:56,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1984651882, now seen corresponding path program 1 times [2024-11-12 01:09:56,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:09:56,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714493988] [2024-11-12 01:09:56,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:09:56,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:09:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:09:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:09:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:09:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:09:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:09:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:09:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:09:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 01:09:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 01:09:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 01:09:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 01:09:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 01:09:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 01:09:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 01:09:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 01:09:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 01:09:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 01:09:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 01:09:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 01:09:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-12 01:09:57,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:09:57,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714493988] [2024-11-12 01:09:57,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714493988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:09:57,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629550571] [2024-11-12 01:09:57,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:09:57,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:09:57,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:09:57,227 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-12 01:09:57,231 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-12 01:09:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:09:57,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 01:09:57,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:09:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 437 proven. 39 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-12 01:09:57,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:09:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 63 proven. 42 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-11-12 01:09:57,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629550571] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 01:09:57,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 01:09:57,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2024-11-12 01:09:57,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577904964] [2024-11-12 01:09:57,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 01:09:57,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 01:09:57,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:09:57,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 01:09:57,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-12 01:09:57,907 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 6 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-12 01:09:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:09:58,367 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2024-11-12 01:09:58,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 01:09:58,367 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 6 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) Word has length 126 [2024-11-12 01:09:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:09:58,369 INFO L225 Difference]: With dead ends: 133 [2024-11-12 01:09:58,369 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 01:09:58,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=279, Invalid=651, Unknown=0, NotChecked=0, Total=930 [2024-11-12 01:09:58,371 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 205 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:09:58,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 169 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:09:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 01:09:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-11-12 01:09:58,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 01:09:58,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2024-11-12 01:09:58,382 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 126 [2024-11-12 01:09:58,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:09:58,383 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2024-11-12 01:09:58,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 6 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-12 01:09:58,383 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2024-11-12 01:09:58,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-12 01:09:58,384 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:09:58,385 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:09:58,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 01:09:58,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:09:58,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:09:58,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:09:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash 716240933, now seen corresponding path program 1 times [2024-11-12 01:09:58,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:09:58,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162964101] [2024-11-12 01:09:58,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:09:58,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:09:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:09:58,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1962090625] [2024-11-12 01:09:58,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:09:58,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:09:58,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:09:58,684 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:09:58,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 01:09:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:09:58,796 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:09:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:09:58,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:09:58,876 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:09:58,877 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:09:58,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 01:09:59,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-12 01:09:59,082 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 01:09:59,147 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:09:59,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:09:59 BoogieIcfgContainer [2024-11-12 01:09:59,154 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:09:59,154 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:09:59,155 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:09:59,155 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:09:59,155 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:09:55" (3/4) ... [2024-11-12 01:09:59,157 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:09:59,158 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:09:59,158 INFO L158 Benchmark]: Toolchain (without parser) took 4251.28ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 69.7MB in the beginning and 106.6MB in the end (delta: -36.9MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-11-12 01:09:59,159 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 142.6MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:09:59,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.76ms. Allocated memory is still 142.6MB. Free memory was 69.5MB in the beginning and 54.1MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 01:09:59,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.39ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 54.1MB in the beginning and 177.4MB in the end (delta: -123.3MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-12 01:09:59,160 INFO L158 Benchmark]: Boogie Preprocessor took 65.05ms. Allocated memory is still 207.6MB. Free memory was 177.4MB in the beginning and 174.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:09:59,160 INFO L158 Benchmark]: RCFGBuilder took 473.62ms. Allocated memory is still 207.6MB. Free memory was 174.7MB in the beginning and 154.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 01:09:59,160 INFO L158 Benchmark]: TraceAbstraction took 3282.79ms. Allocated memory is still 207.6MB. Free memory was 153.7MB in the beginning and 106.6MB in the end (delta: 47.1MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2024-11-12 01:09:59,160 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 207.6MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:09:59,162 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.11ms. Allocated memory is still 142.6MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.76ms. Allocated memory is still 142.6MB. Free memory was 69.5MB in the beginning and 54.1MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.39ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 54.1MB in the beginning and 177.4MB in the end (delta: -123.3MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.05ms. Allocated memory is still 207.6MB. Free memory was 177.4MB in the beginning and 174.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.62ms. Allocated memory is still 207.6MB. Free memory was 174.7MB in the beginning and 154.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3282.79ms. Allocated memory is still 207.6MB. Free memory was 153.7MB in the beginning and 106.6MB in the end (delta: 47.1MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 207.6MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryArithmeticDOUBLEoperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryArithmeticFLOAToperation at line 59. Possible FailurePath: [L26] unsigned char isInitial = 0; [L27] double var_1_1 = 100.25; [L28] unsigned char var_1_2 = 0; [L29] unsigned char var_1_3 = 8; [L30] unsigned char var_1_4 = 0; [L31] double var_1_5 = 1.9; [L32] double var_1_6 = 7.5; [L33] double var_1_7 = 64.25; [L34] signed long int var_1_8 = 2; [L35] signed long int var_1_9 = 1000000000; [L36] signed long int var_1_10 = 1000000000; [L37] signed long int var_1_11 = 1957998270; [L38] float var_1_12 = 50.25; [L39] float var_1_13 = 9.8; [L40] float var_1_14 = 25.5; [L41] float var_1_15 = 3.5; [L42] signed long int var_1_16 = -500; [L43] unsigned char var_1_17 = 1; [L44] unsigned char var_1_18 = 1; [L45] unsigned char var_1_19 = 0; VAL [isInitial=0, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L138] isInitial = 1 [L139] FCALL initially() [L140] COND TRUE 1 [L141] FCALL updateLastVariables() [L142] CALL updateVariables() [L99] var_1_2 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L100] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L101] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L101] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_3=8, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L102] var_1_3 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L103] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L104] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L104] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_4=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L105] var_1_4 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L106] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L107] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L107] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L108] var_1_5 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L109] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L110] var_1_6 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L111] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L112] var_1_7 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1000000000] [L113] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=1000000000] [L114] var_1_9 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_9 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L115] RET assume_abort_if_not(var_1_9 >= 536870911) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L116] CALL assume_abort_if_not(var_1_9 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L116] RET assume_abort_if_not(var_1_9 <= 1073741823) VAL [isInitial=1, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L117] var_1_10 = __VERIFIER_nondet_long() [L118] CALL assume_abort_if_not(var_1_10 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L118] RET assume_abort_if_not(var_1_10 >= 536870911) VAL [isInitial=1, var_1_10=536870977, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L119] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L119] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, var_1_10=536870977, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L120] var_1_11 = __VERIFIER_nondet_long() [L121] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L121] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L122] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L122] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L123] var_1_14 = __VERIFIER_nondet_float() [L124] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L124] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L125] var_1_15 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L126] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L127] var_1_18 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L128] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L129] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L129] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_2=0, var_1_8=2, var_1_9=536870911] [L142] RET updateVariables() [L143] CALL step() [L82] CALL functionized0(var_1_7, 4.125) [L47] COND FALSE !(\read(var_1_2)) [L54] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_5=3, var_1_7=2, var_1_8=2, var_1_9=536870911] [L82] RET functionized0(var_1_7, 4.125) [L83] var_1_8 = (((var_1_9 + var_1_10) - var_1_3) - (var_1_11 - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=65, var_1_4=0, var_1_5=3, var_1_7=2, var_1_8=0, var_1_9=536870911] [L84] COND TRUE ((((var_1_3) < (var_1_9)) ? (var_1_3) : (var_1_9))) >= (var_1_4 - var_1_11) [L85] var_1_12 = var_1_7 VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=65, var_1_4=0, var_1_5=3, var_1_7=2, var_1_8=0, var_1_9=536870911] [L87] CALL functionized1(var_1_8, var_1_15, var_1_14) [L58] COND TRUE functionized1_localFunctionVar0 < var_1_11 [L59] var_1_13 = ((7.3868261718112563E18f - (functionized1_localFunctionVar2 + functionized1_localFunctionVar1)) - 5.4f) VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=2, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=65, var_1_4=0, var_1_5=3, var_1_7=2, var_1_8=0, var_1_9=536870911] [L87] RET functionized1(var_1_8, var_1_15, var_1_14) [L88] CALL functionized2(var_1_6, var_1_5, var_1_13) [L65] COND FALSE !((((((- var_1_15)) > ((functionized2_localFunctionVar2 * functionized2_localFunctionVar0))) ? ((- var_1_15)) : ((functionized2_localFunctionVar2 * functionized2_localFunctionVar0)))) < functionized2_localFunctionVar1) VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=65, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] [L88] RET functionized2(var_1_6, var_1_5, var_1_13) [L89] CALL functionized3(var_1_16, var_1_8, var_1_18, var_1_9) [L74] var_1_17 = (((var_1_3 * functionized3_localFunctionVar3) >= ((((functionized3_localFunctionVar0) > (functionized3_localFunctionVar1)) ? (functionized3_localFunctionVar0) : (functionized3_localFunctionVar1)))) || functionized3_localFunctionVar2) VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=65, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] [L89] RET functionized3(var_1_16, var_1_8, var_1_18, var_1_9) [L90] COND TRUE \read(var_1_17) [L91] CALL, EXPR functionized4() [L77] return (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (var_1_13 * 63.375)); VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_2=0, var_1_3=65, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] [L91] RET, EXPR functionized4() [L91] COND TRUE var_1_7 > functionized4() [L92] var_1_19 = var_1_18 VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=65, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] [L143] RET step() [L144] CALL, EXPR property() [L134-L135] return ((((((var_1_2 ? ((var_1_3 >= var_1_4) ? (var_1_1 == ((double) (var_1_5 + var_1_6))) : (var_1_1 == ((double) (4.125 - var_1_7)))) : (var_1_1 == ((double) var_1_5))) && (var_1_8 == ((signed long int) (((var_1_9 + var_1_10) - var_1_3) - (var_1_11 - ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) && ((((((var_1_3) < (var_1_9)) ? (var_1_3) : (var_1_9))) >= (var_1_4 - var_1_11)) ? (var_1_12 == ((float) var_1_7)) : 1)) && ((var_1_8 < var_1_11) ? (var_1_13 == ((float) ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f))) : (var_1_13 == ((float) (var_1_15 + ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))))))) && (((((((- var_1_15)) > ((var_1_13 * var_1_6))) ? ((- var_1_15)) : ((var_1_13 * var_1_6)))) < var_1_5) ? ((var_1_11 != ((((var_1_8) < (var_1_10)) ? (var_1_8) : (var_1_10)))) ? (var_1_2 ? (var_1_16 == ((signed long int) var_1_3)) : 1) : 1) : 1)) && (var_1_17 == ((unsigned char) (((var_1_3 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18)))) && (var_1_17 ? ((var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (var_1_13 * 63.375))) ? (var_1_19 == ((unsigned char) var_1_18)) : 1) : (var_1_19 == ((unsigned char) var_1_18))) ; VAL [\result=0, isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=65, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=65, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] [L19] reach_error() VAL [isInitial=1, var_1_10=536870977, var_1_11=1073741823, var_1_12=2, var_1_13=7, var_1_14=5, var_1_15=4, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=65, var_1_4=0, var_1_5=3, var_1_6=6, var_1_7=2, var_1_8=0, var_1_9=536870911] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 257 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 213 IncrementalHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 143 mSDtfsCounter, 213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=2, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 500 ConstructedInterpolants, 0 QuantifiedInterpolants, 1029 SizeOfPredicates, 7 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2652/2736 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-12 01:09:59,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.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 758300177d1b355ef883590ed584633de094bad912a987cbd68951ea58e51ff9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:10:01,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:10:01,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:10:01,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:10:01,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:10:01,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:10:01,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:10:01,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:10:01,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:10:01,380 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:10:01,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:10:01,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:10:01,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:10:01,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:10:01,384 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:10:01,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:10:01,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:10:01,385 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:10:01,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:10:01,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:10:01,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:10:01,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:10:01,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:10:01,386 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:10:01,386 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:10:01,386 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:10:01,386 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:10:01,386 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:10:01,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:10:01,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:10:01,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:10:01,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:10:01,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:10:01,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:10:01,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:10:01,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:10:01,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:10:01,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:10:01,388 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:10:01,388 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:10:01,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:10:01,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:10:01,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:10:01,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:10:01,392 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 -> 758300177d1b355ef883590ed584633de094bad912a987cbd68951ea58e51ff9 [2024-11-12 01:10:01,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:10:01,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:10:01,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:10:01,665 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:10:01,665 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:10:01,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i [2024-11-12 01:10:03,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:10:03,409 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:10:03,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-6.i [2024-11-12 01:10:03,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/146d73d9f/a155dcafb1144461b948be4f865b3f2d/FLAGed4cb29a0 [2024-11-12 01:10:03,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/146d73d9f/a155dcafb1144461b948be4f865b3f2d [2024-11-12 01:10:03,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:10:03,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:10:03,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:10:03,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:10:03,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:10:03,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:10:03" (1/1) ... [2024-11-12 01:10:03,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33e04692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:03, skipping insertion in model container [2024-11-12 01:10:03,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:10:03" (1/1) ... [2024-11-12 01:10:03,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:10:03,652 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_codestructure_functionizing_file-6.i[919,932] [2024-11-12 01:10:03,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:10:03,736 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:10:03,748 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_codestructure_functionizing_file-6.i[919,932] [2024-11-12 01:10:03,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:10:03,806 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:10:03,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:03 WrapperNode [2024-11-12 01:10:03,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:10:03,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:10:03,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:10:03,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:10:03,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:03" (1/1) ... [2024-11-12 01:10:03,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:03" (1/1) ... [2024-11-12 01:10:03,859 INFO L138 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 149 [2024-11-12 01:10:03,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:10:03,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:10:03,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:10:03,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:10:03,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:03" (1/1) ... [2024-11-12 01:10:03,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:03" (1/1) ... [2024-11-12 01:10:03,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:03" (1/1) ... [2024-11-12 01:10:03,896 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-12 01:10:03,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:03" (1/1) ... [2024-11-12 01:10:03,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:03" (1/1) ... [2024-11-12 01:10:03,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:03" (1/1) ... [2024-11-12 01:10:03,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:03" (1/1) ... [2024-11-12 01:10:03,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:03" (1/1) ... [2024-11-12 01:10:03,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:03" (1/1) ... [2024-11-12 01:10:03,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:10:03,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:10:03,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:10:03,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:10:03,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:03" (1/1) ... [2024-11-12 01:10:03,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:10:03,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:10:03,962 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-12 01:10:03,965 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-12 01:10:03,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:10:03,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:10:03,999 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:10:03,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:10:03,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:10:03,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:10:04,074 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:10:04,077 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:10:24,002 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-12 01:10:24,002 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:10:24,020 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:10:24,021 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:10:24,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:10:24 BoogieIcfgContainer [2024-11-12 01:10:24,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:10:24,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:10:24,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:10:24,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:10:24,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:10:03" (1/3) ... [2024-11-12 01:10:24,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2798a34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:10:24, skipping insertion in model container [2024-11-12 01:10:24,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:03" (2/3) ... [2024-11-12 01:10:24,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2798a34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:10:24, skipping insertion in model container [2024-11-12 01:10:24,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:10:24" (3/3) ... [2024-11-12 01:10:24,030 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-6.i [2024-11-12 01:10:24,043 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:10:24,043 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:10:24,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:10:24,103 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;@780cd895, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:10:24,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:10:24,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 01:10:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-12 01:10:24,118 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:10:24,119 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:10:24,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:10:24,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:10:24,128 INFO L85 PathProgramCache]: Analyzing trace with hash -812521492, now seen corresponding path program 1 times [2024-11-12 01:10:24,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:10:24,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690445214] [2024-11-12 01:10:24,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:10:24,154 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-12 01:10:24,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:10:24,157 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-12 01:10:24,191 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-12 01:10:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:25,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:10:25,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:10:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-12 01:10:25,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:10:25,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:10:25,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690445214] [2024-11-12 01:10:25,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690445214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:10:25,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:10:25,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:10:25,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666678747] [2024-11-12 01:10:25,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:10:25,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:10:25,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:10:25,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:10:25,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:10:25,291 INFO L87 Difference]: Start difference. First operand has 65 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 01:10:25,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:10:25,318 INFO L93 Difference]: Finished difference Result 123 states and 203 transitions. [2024-11-12 01:10:25,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:10:25,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2024-11-12 01:10:25,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:10:25,327 INFO L225 Difference]: With dead ends: 123 [2024-11-12 01:10:25,328 INFO L226 Difference]: Without dead ends: 61 [2024-11-12 01:10:25,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-12 01:10:25,332 INFO L435 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-12 01:10:25,333 INFO L436 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-12 01:10:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-12 01:10:25,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-12 01:10:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 01:10:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2024-11-12 01:10:25,366 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 126 [2024-11-12 01:10:25,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:10:25,366 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2024-11-12 01:10:25,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 01:10:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2024-11-12 01:10:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-12 01:10:25,369 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:10:25,369 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:10:25,398 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-12 01:10:25,573 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-12 01:10:25,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:10:25,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:10:25,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1984651882, now seen corresponding path program 1 times [2024-11-12 01:10:25,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:10:25,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668104633] [2024-11-12 01:10:25,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:10:25,576 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-12 01:10:25,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:10:25,579 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-12 01:10:25,580 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-12 01:10:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:26,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 01:10:26,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:10:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-12 01:10:28,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:10:28,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:10:28,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668104633] [2024-11-12 01:10:28,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668104633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:10:28,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:10:28,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 01:10:28,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120853754] [2024-11-12 01:10:28,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:10:28,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 01:10:28,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:10:28,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 01:10:28,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 01:10:28,984 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 01:10:36,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:10:40,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:10:42,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:10:46,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:10:50,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:10:54,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:10:58,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:11:02,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:11:02,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:11:02,534 INFO L93 Difference]: Finished difference Result 129 states and 181 transitions. [2024-11-12 01:11:02,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 01:11:02,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2024-11-12 01:11:02,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:11:02,668 INFO L225 Difference]: With dead ends: 129 [2024-11-12 01:11:02,668 INFO L226 Difference]: Without dead ends: 71 [2024-11-12 01:11:02,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2024-11-12 01:11:02,674 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 94 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 77 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:11:02,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 194 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 32.2s Time] [2024-11-12 01:11:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-12 01:11:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-12 01:11:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 01:11:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2024-11-12 01:11:02,696 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 126 [2024-11-12 01:11:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:11:02,696 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2024-11-12 01:11:02,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 01:11:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2024-11-12 01:11:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-12 01:11:02,699 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:11:02,699 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:11:02,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 01:11:02,900 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-12 01:11:02,901 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:11:02,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:11:02,902 INFO L85 PathProgramCache]: Analyzing trace with hash -294876317, now seen corresponding path program 1 times [2024-11-12 01:11:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:11:02,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927048064] [2024-11-12 01:11:02,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:02,904 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-12 01:11:02,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:11:02,906 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-12 01:11:02,908 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-12 01:11:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:04,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 01:11:04,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:11:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 437 proven. 39 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-12 01:11:07,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:11:09,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:11:09,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927048064] [2024-11-12 01:11:09,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927048064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:11:09,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [206235885] [2024-11-12 01:11:09,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:09,256 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 01:11:09,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 01:11:09,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 01:11:09,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-12 01:11:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:12,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 01:11:12,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:11:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 428 proven. 57 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-12 01:11:18,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:11:19,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [206235885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:11:19,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 01:11:19,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 12 [2024-11-12 01:11:19,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801398676] [2024-11-12 01:11:19,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 01:11:19,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 01:11:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:11:19,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 01:11:19,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-12 01:11:19,414 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 5 states have call successors, (27), 5 states have call predecessors, (27), 8 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2024-11-12 01:11:25,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:11:27,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:11:31,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:11:35,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []