./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 88c8c44b1b28036571c76e8aef19341d15502335b9d8765faffaa5e0dad5ad9d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:21:07,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:21:07,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:21:07,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:21:07,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:21:07,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:21:07,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:21:07,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:21:07,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:21:07,537 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:21:07,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:21:07,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:21:07,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:21:07,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:21:07,541 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:21:07,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:21:07,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:21:07,542 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:21:07,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:21:07,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:21:07,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:21:07,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:21:07,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:21:07,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:21:07,545 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:21:07,545 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:21:07,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:21:07,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:21:07,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:21:07,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:21:07,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:21:07,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:21:07,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:21:07,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:21:07,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:21:07,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:21:07,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:21:07,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:21:07,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:21:07,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:21:07,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:21:07,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:21:07,551 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 88c8c44b1b28036571c76e8aef19341d15502335b9d8765faffaa5e0dad5ad9d [2024-10-11 07:21:07,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:21:07,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:21:07,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:21:07,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:21:07,836 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:21:07,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i [2024-10-11 07:21:09,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:21:09,471 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:21:09,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i [2024-10-11 07:21:09,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1fd0cb2a3/3289a9fd97724c7a8eeec924e9d8c7df/FLAG4ec7f0cb6 [2024-10-11 07:21:09,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1fd0cb2a3/3289a9fd97724c7a8eeec924e9d8c7df [2024-10-11 07:21:09,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:21:09,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:21:09,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:21:09,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:21:09,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:21:09,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:09" (1/1) ... [2024-10-11 07:21:09,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df41c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:09, skipping insertion in model container [2024-10-11 07:21:09,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:09" (1/1) ... [2024-10-11 07:21:09,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:21:10,059 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i[913,926] [2024-10-11 07:21:10,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:21:10,124 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:21:10,134 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i[913,926] [2024-10-11 07:21:10,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:21:10,192 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:21:10,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:10 WrapperNode [2024-10-11 07:21:10,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:21:10,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:21:10,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:21:10,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:21:10,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:10" (1/1) ... [2024-10-11 07:21:10,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:10" (1/1) ... [2024-10-11 07:21:10,285 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2024-10-11 07:21:10,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:21:10,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:21:10,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:21:10,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:21:10,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:10" (1/1) ... [2024-10-11 07:21:10,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:10" (1/1) ... [2024-10-11 07:21:10,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:10" (1/1) ... [2024-10-11 07:21:10,335 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:21:10,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:10" (1/1) ... [2024-10-11 07:21:10,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:10" (1/1) ... [2024-10-11 07:21:10,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:10" (1/1) ... [2024-10-11 07:21:10,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:10" (1/1) ... [2024-10-11 07:21:10,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:10" (1/1) ... [2024-10-11 07:21:10,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:10" (1/1) ... [2024-10-11 07:21:10,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:21:10,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:21:10,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:21:10,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:21:10,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:10" (1/1) ... [2024-10-11 07:21:10,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:21:10,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:21:10,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:21:10,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:21:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:21:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:21:10,445 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:21:10,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:21:10,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:21:10,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:21:10,515 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:21:10,518 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:21:10,932 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:21:10,933 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:21:10,999 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:21:10,999 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:21:11,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:11 BoogieIcfgContainer [2024-10-11 07:21:11,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:21:11,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:21:11,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:21:11,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:21:11,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:21:09" (1/3) ... [2024-10-11 07:21:11,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a0749f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:21:11, skipping insertion in model container [2024-10-11 07:21:11,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:10" (2/3) ... [2024-10-11 07:21:11,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a0749f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:21:11, skipping insertion in model container [2024-10-11 07:21:11,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:11" (3/3) ... [2024-10-11 07:21:11,009 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-41.i [2024-10-11 07:21:11,023 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:21:11,024 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:21:11,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:21:11,084 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;@56e3c840, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:21:11,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:21:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 07:21:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 07:21:11,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:21:11,101 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:21:11,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:21:11,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:21:11,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1980114981, now seen corresponding path program 1 times [2024-10-11 07:21:11,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:21:11,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024030684] [2024-10-11 07:21:11,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:11,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:21:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:21:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:21:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:21:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:21:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:21:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:21:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:21:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:21:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:21:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 07:21:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:21:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:21:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:21:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:21:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:21:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:21:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:21:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:21:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:21:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:21:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:21:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:21:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:21:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 07:21:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:21:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 07:21:11,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:21:11,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024030684] [2024-10-11 07:21:11,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024030684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:21:11,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:21:11,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:21:11,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562685541] [2024-10-11 07:21:11,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:21:11,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:21:11,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:21:11,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:21:11,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:21:11,612 INFO L87 Difference]: Start difference. First operand has 62 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 07:21:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:21:11,671 INFO L93 Difference]: Finished difference Result 121 states and 221 transitions. [2024-10-11 07:21:11,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:21:11,674 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 151 [2024-10-11 07:21:11,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:21:11,682 INFO L225 Difference]: With dead ends: 121 [2024-10-11 07:21:11,683 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 07:21:11,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:21:11,693 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:21:11,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:21:11,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 07:21:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-11 07:21:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 07:21:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 94 transitions. [2024-10-11 07:21:11,754 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 94 transitions. Word has length 151 [2024-10-11 07:21:11,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:21:11,754 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 94 transitions. [2024-10-11 07:21:11,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 07:21:11,755 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 94 transitions. [2024-10-11 07:21:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 07:21:11,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:21:11,761 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:21:11,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:21:11,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:21:11,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:21:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2120570013, now seen corresponding path program 1 times [2024-10-11 07:21:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:21:11,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89824600] [2024-10-11 07:21:11,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:11,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:21:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:21:12,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874894993] [2024-10-11 07:21:12,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:12,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:21:12,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:21:12,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:21:12,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:21:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:12,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 07:21:12,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:21:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 532 proven. 33 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-10-11 07:21:13,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:21:15,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:21:15,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89824600] [2024-10-11 07:21:15,197 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 07:21:15,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874894993] [2024-10-11 07:21:15,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874894993] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:21:15,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 07:21:15,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-10-11 07:21:15,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684862326] [2024-10-11 07:21:15,199 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 07:21:15,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 07:21:15,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:21:15,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 07:21:15,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-10-11 07:21:15,203 INFO L87 Difference]: Start difference. First operand 60 states and 94 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2024-10-11 07:21:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:21:16,198 INFO L93 Difference]: Finished difference Result 250 states and 367 transitions. [2024-10-11 07:21:16,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 07:21:16,199 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 151 [2024-10-11 07:21:16,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:21:16,205 INFO L225 Difference]: With dead ends: 250 [2024-10-11 07:21:16,205 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 07:21:16,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=293, Invalid=699, Unknown=0, NotChecked=0, Total=992 [2024-10-11 07:21:16,210 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 85 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 07:21:16,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 570 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 07:21:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 07:21:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 169. [2024-10-11 07:21:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 95 states have internal predecessors, (117), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-11 07:21:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 251 transitions. [2024-10-11 07:21:16,269 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 251 transitions. Word has length 151 [2024-10-11 07:21:16,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:21:16,270 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 251 transitions. [2024-10-11 07:21:16,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2024-10-11 07:21:16,270 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 251 transitions. [2024-10-11 07:21:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 07:21:16,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:21:16,274 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:21:16,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 07:21:16,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:21:16,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:21:16,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:21:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2117138981, now seen corresponding path program 1 times [2024-10-11 07:21:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:21:16,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504046590] [2024-10-11 07:21:16,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:16,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:21:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:21:16,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [834889274] [2024-10-11 07:21:16,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:16,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:21:16,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:21:16,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:21:16,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 07:21:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:16,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 07:21:16,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:21:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 532 proven. 33 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-10-11 07:21:17,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:21:18,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:21:18,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504046590] [2024-10-11 07:21:18,560 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 07:21:18,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834889274] [2024-10-11 07:21:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834889274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:21:18,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 07:21:18,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-10-11 07:21:18,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731219402] [2024-10-11 07:21:18,561 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 07:21:18,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 07:21:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:21:18,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 07:21:18,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2024-10-11 07:21:18,563 INFO L87 Difference]: Start difference. First operand 169 states and 251 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2024-10-11 07:21:19,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:21:19,727 INFO L93 Difference]: Finished difference Result 350 states and 500 transitions. [2024-10-11 07:21:19,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-11 07:21:19,728 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 151 [2024-10-11 07:21:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:21:19,732 INFO L225 Difference]: With dead ends: 350 [2024-10-11 07:21:19,733 INFO L226 Difference]: Without dead ends: 291 [2024-10-11 07:21:19,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=366, Invalid=894, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 07:21:19,735 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 168 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 07:21:19,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 443 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 07:21:19,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-11 07:21:19,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 222. [2024-10-11 07:21:19,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 125 states have (on average 1.2) internal successors, (150), 127 states have internal predecessors, (150), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-11 07:21:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 318 transitions. [2024-10-11 07:21:19,793 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 318 transitions. Word has length 151 [2024-10-11 07:21:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:21:19,795 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 318 transitions. [2024-10-11 07:21:19,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2024-10-11 07:21:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 318 transitions. [2024-10-11 07:21:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 07:21:19,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:21:19,798 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:21:19,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 07:21:19,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:21:19,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:21:19,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:21:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1313888378, now seen corresponding path program 1 times [2024-10-11 07:21:20,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:21:20,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591623168] [2024-10-11 07:21:20,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:20,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:21:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:21:20,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1613149955] [2024-10-11 07:21:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:20,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:21:20,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:21:20,107 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:21:20,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 07:21:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:21:20,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:21:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:21:20,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:21:20,395 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:21:20,396 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:21:20,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 07:21:20,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:21:20,601 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 07:21:20,710 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:21:20,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:21:20 BoogieIcfgContainer [2024-10-11 07:21:20,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:21:20,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:21:20,716 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:21:20,717 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:21:20,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:11" (3/4) ... [2024-10-11 07:21:20,718 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:21:20,720 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:21:20,720 INFO L158 Benchmark]: Toolchain (without parser) took 10875.91ms. Allocated memory was 159.4MB in the beginning and 285.2MB in the end (delta: 125.8MB). Free memory was 102.7MB in the beginning and 125.5MB in the end (delta: -22.7MB). Peak memory consumption was 105.6MB. Max. memory is 16.1GB. [2024-10-11 07:21:20,720 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:21:20,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.79ms. Allocated memory is still 159.4MB. Free memory was 102.4MB in the beginning and 87.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 07:21:20,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.50ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 83.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:21:20,721 INFO L158 Benchmark]: Boogie Preprocessor took 81.66ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 78.0MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:21:20,721 INFO L158 Benchmark]: RCFGBuilder took 627.17ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 77.6MB in the beginning and 189.7MB in the end (delta: -112.1MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-10-11 07:21:20,722 INFO L158 Benchmark]: TraceAbstraction took 9712.65ms. Allocated memory was 237.0MB in the beginning and 285.2MB in the end (delta: 48.2MB). Free memory was 189.7MB in the beginning and 126.5MB in the end (delta: 63.1MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. [2024-10-11 07:21:20,722 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 285.2MB. Free memory was 126.5MB in the beginning and 125.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:21:20,724 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.16ms. Allocated memory is still 159.4MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.79ms. Allocated memory is still 159.4MB. Free memory was 102.4MB in the beginning and 87.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.50ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 83.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.66ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 78.0MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 627.17ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 77.6MB in the beginning and 189.7MB in the end (delta: -112.1MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9712.65ms. Allocated memory was 237.0MB in the beginning and 285.2MB in the end (delta: 48.2MB). Free memory was 189.7MB in the beginning and 126.5MB in the end (delta: 63.1MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 285.2MB. Free memory was 126.5MB in the beginning and 125.5MB in the end (delta: 1.0MB). 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 132, overapproximation of someBinaryDOUBLEComparisonOperation at line 132. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 100.25; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 1; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] double var_1_7 = 4.8; [L29] signed char var_1_8 = 64; [L30] unsigned short int var_1_9 = 4; [L31] unsigned short int var_1_10 = 0; [L32] signed char var_1_11 = -10; [L33] signed char var_1_12 = 64; [L34] float var_1_13 = 1.6; [L35] float var_1_14 = 3.5; [L36] unsigned char var_1_15 = 8; [L37] unsigned char var_1_16 = 4; [L38] unsigned short int var_1_17 = 2; [L39] unsigned short int var_1_18 = 10000; [L40] unsigned short int var_1_19 = 5; [L41] signed short int var_1_20 = 4; [L42] unsigned long int var_1_21 = 5; [L43] signed char var_1_22 = -32; [L44] unsigned long int var_1_23 = 0; [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] FCALL updateLastVariables() [L140] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L90] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L91] var_1_3 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L92] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L93] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L94] var_1_4 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L95] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L96] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L96] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L97] var_1_5 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L98] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L99] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L99] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L100] var_1_7 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64, var_1_9=4] [L101] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64, var_1_9=4] [L102] var_1_9 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L103] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L104] CALL assume_abort_if_not(var_1_9 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L104] RET assume_abort_if_not(var_1_9 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L105] var_1_10 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L106] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L107] CALL assume_abort_if_not(var_1_10 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L107] RET assume_abort_if_not(var_1_10 <= 65535) VAL [isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L108] var_1_11 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L109] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L110] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L110] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L111] var_1_12 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L112] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L113] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L113] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L114] var_1_14 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L115] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L116] var_1_16 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L117] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L118] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L118] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L119] var_1_18 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_18 >= 8192) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L120] RET assume_abort_if_not(var_1_18 >= 8192) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L121] CALL assume_abort_if_not(var_1_18 <= 16384) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L121] RET assume_abort_if_not(var_1_18 <= 16384) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L122] var_1_19 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L123] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L124] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L124] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L125] var_1_21 = __VERIFIER_nondet_ulong() [L126] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L126] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L127] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L127] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L140] RET updateVariables() [L141] CALL step() [L48] COND TRUE (- var_1_2) > 31.9f [L49] var_1_1 = ((var_1_3 || var_1_4) && var_1_5) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L53] COND FALSE !((127.35 + var_1_2) <= var_1_7) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L58] COND TRUE var_1_9 > var_1_10 [L59] var_1_8 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L61] COND FALSE !((! var_1_5) || (var_1_12 < var_1_8)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L68] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=2, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L71] COND TRUE var_1_3 || (var_1_9 < var_1_15) [L72] var_1_17 = (var_1_15 + ((var_1_18 - var_1_16) + var_1_19)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=7946, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L76] COND FALSE !(((var_1_17 / var_1_18) * var_1_19) < -10) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=7946, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L79] COND FALSE !(! (var_1_21 <= var_1_10)) [L82] var_1_20 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=7946, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=-32, var_1_23=0, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L85] var_1_22 = 1 [L86] var_1_23 = var_1_15 [L141] RET step() [L142] CALL, EXPR property() [L132-L133] return ((((((((((- var_1_2) > 31.9f) ? (var_1_1 == ((unsigned char) ((var_1_3 || var_1_4) && var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && (((127.35 + var_1_2) <= var_1_7) ? ((4.5 <= (var_1_7 * var_1_2)) ? (var_1_6 == ((unsigned char) var_1_5)) : 1) : 1)) && ((var_1_9 > var_1_10) ? (var_1_8 == ((signed char) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : 1)) && (((! var_1_5) || (var_1_12 < var_1_8)) ? ((! var_1_5) ? (var_1_13 == ((float) var_1_14)) : (var_1_13 == ((float) var_1_14))) : 1)) && (var_1_3 ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && ((var_1_3 || (var_1_9 < var_1_15)) ? (var_1_17 == ((unsigned short int) (var_1_15 + ((var_1_18 - var_1_16) + var_1_19)))) : (var_1_17 == ((unsigned short int) (var_1_16 + var_1_18))))) && ((((var_1_17 / var_1_18) * var_1_19) < -10) ? (var_1_20 == ((signed short int) ((((var_1_19) > (var_1_16)) ? (var_1_19) : (var_1_16))))) : ((! (var_1_21 <= var_1_10)) ? (var_1_20 == ((signed short int) var_1_11)) : (var_1_20 == ((signed short int) var_1_12))))) && (var_1_22 == ((signed char) 1))) && (var_1_23 == ((unsigned long int) var_1_15)) ; [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=7946, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=8, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=-2, var_1_17=7946, var_1_18=73728, var_1_19=-262144, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=8, var_1_3=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253 mSDsluCounter, 1104 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 818 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1252 IncrementalHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 286 mSDtfsCounter, 1252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 454 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=3, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 91 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1059 NumberOfCodeBlocks, 1059 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 450 ConstructedInterpolants, 0 QuantifiedInterpolants, 2140 SizeOfPredicates, 10 NumberOfNonLiveVariables, 679 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 3534/3600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 07:21:20,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 88c8c44b1b28036571c76e8aef19341d15502335b9d8765faffaa5e0dad5ad9d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:21:23,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:21:23,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:21:23,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:21:23,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:21:23,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:21:23,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:21:23,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:21:23,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:21:23,245 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:21:23,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:21:23,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:21:23,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:21:23,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:21:23,247 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:21:23,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:21:23,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:21:23,251 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:21:23,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:21:23,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:21:23,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:21:23,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:21:23,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:21:23,256 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:21:23,256 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:21:23,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:21:23,257 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:21:23,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:21:23,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:21:23,257 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:21:23,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:21:23,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:21:23,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:21:23,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:21:23,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:21:23,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:21:23,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:21:23,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:21:23,262 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:21:23,262 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:21:23,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:21:23,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:21:23,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:21:23,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:21:23,263 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:21:23,264 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 88c8c44b1b28036571c76e8aef19341d15502335b9d8765faffaa5e0dad5ad9d [2024-10-11 07:21:23,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:21:23,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:21:23,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:21:23,636 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:21:23,637 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:21:23,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i [2024-10-11 07:21:25,278 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:21:25,500 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:21:25,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i [2024-10-11 07:21:25,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/38bc4a68e/f31648928756493fb2f259507c480930/FLAG512733891 [2024-10-11 07:21:25,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/38bc4a68e/f31648928756493fb2f259507c480930 [2024-10-11 07:21:25,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:21:25,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:21:25,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:21:25,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:21:25,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:21:25,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:25" (1/1) ... [2024-10-11 07:21:25,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@452fb959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:25, skipping insertion in model container [2024-10-11 07:21:25,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:25" (1/1) ... [2024-10-11 07:21:25,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:21:25,803 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i[913,926] [2024-10-11 07:21:25,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:21:25,909 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:21:25,922 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-41.i[913,926] [2024-10-11 07:21:25,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:21:25,984 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:21:25,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:25 WrapperNode [2024-10-11 07:21:25,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:21:25,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:21:25,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:21:25,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:21:25,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:25" (1/1) ... [2024-10-11 07:21:26,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:25" (1/1) ... [2024-10-11 07:21:26,047 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-10-11 07:21:26,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:21:26,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:21:26,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:21:26,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:21:26,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:25" (1/1) ... [2024-10-11 07:21:26,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:25" (1/1) ... [2024-10-11 07:21:26,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:25" (1/1) ... [2024-10-11 07:21:26,092 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:21:26,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:25" (1/1) ... [2024-10-11 07:21:26,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:25" (1/1) ... [2024-10-11 07:21:26,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:25" (1/1) ... [2024-10-11 07:21:26,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:25" (1/1) ... [2024-10-11 07:21:26,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:25" (1/1) ... [2024-10-11 07:21:26,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:25" (1/1) ... [2024-10-11 07:21:26,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:21:26,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:21:26,121 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:21:26,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:21:26,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:25" (1/1) ... [2024-10-11 07:21:26,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:21:26,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:21:26,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:21:26,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:21:26,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:21:26,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:21:26,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:21:26,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:21:26,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:21:26,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:21:26,283 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:21:26,285 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:21:36,274 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:21:36,275 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:21:36,362 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:21:36,362 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:21:36,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:36 BoogieIcfgContainer [2024-10-11 07:21:36,363 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:21:36,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:21:36,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:21:36,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:21:36,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:21:25" (1/3) ... [2024-10-11 07:21:36,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e2bfa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:21:36, skipping insertion in model container [2024-10-11 07:21:36,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:25" (2/3) ... [2024-10-11 07:21:36,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e2bfa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:21:36, skipping insertion in model container [2024-10-11 07:21:36,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:36" (3/3) ... [2024-10-11 07:21:36,374 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-41.i [2024-10-11 07:21:36,391 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:21:36,391 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:21:36,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:21:36,492 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;@3c07be5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:21:36,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:21:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 07:21:36,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 07:21:36,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:21:36,514 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:21:36,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:21:36,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:21:36,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1980114981, now seen corresponding path program 1 times [2024-10-11 07:21:36,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:21:36,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340888479] [2024-10-11 07:21:36,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:36,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:21:36,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:21:36,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:21:36,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 07:21:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:36,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:21:36,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:21:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-10-11 07:21:37,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:21:37,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:21:37,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340888479] [2024-10-11 07:21:37,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340888479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:21:37,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:21:37,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:21:37,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127734780] [2024-10-11 07:21:37,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:21:37,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:21:37,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:21:37,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:21:37,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:21:37,059 INFO L87 Difference]: Start difference. First operand has 62 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 07:21:41,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:21:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:21:41,152 INFO L93 Difference]: Finished difference Result 121 states and 221 transitions. [2024-10-11 07:21:41,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:21:41,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 151 [2024-10-11 07:21:41,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:21:41,204 INFO L225 Difference]: With dead ends: 121 [2024-10-11 07:21:41,205 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 07:21:41,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:21:41,215 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:21:41,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 07:21:41,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 07:21:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-11 07:21:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 07:21:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 94 transitions. [2024-10-11 07:21:41,265 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 94 transitions. Word has length 151 [2024-10-11 07:21:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:21:41,265 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 94 transitions. [2024-10-11 07:21:41,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 07:21:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 94 transitions. [2024-10-11 07:21:41,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 07:21:41,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:21:41,271 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:21:41,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 07:21:41,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:21:41,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:21:41,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:21:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2120570013, now seen corresponding path program 1 times [2024-10-11 07:21:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:21:41,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95035049] [2024-10-11 07:21:41,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:41,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:21:41,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:21:41,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:21:41,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 07:21:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:41,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 07:21:41,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:21:44,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 468 proven. 24 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2024-10-11 07:21:44,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:21:45,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:21:45,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95035049] [2024-10-11 07:21:45,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95035049] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:21:45,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1273484048] [2024-10-11 07:21:45,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:45,669 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 07:21:45,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 07:21:45,674 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 07:21:45,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 07:21:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:46,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 07:21:46,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:21:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 468 proven. 24 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2024-10-11 07:21:48,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:21:49,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1273484048] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:21:49,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:21:49,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2024-10-11 07:21:49,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873179205] [2024-10-11 07:21:49,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:21:49,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 07:21:49,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:21:49,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 07:21:49,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:21:49,339 INFO L87 Difference]: Start difference. First operand 60 states and 94 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-11 07:21:55,741 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-10-11 07:21:58,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:21:58,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:21:58,373 INFO L93 Difference]: Finished difference Result 135 states and 200 transitions. [2024-10-11 07:21:58,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 07:21:58,415 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 151 [2024-10-11 07:21:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:21:58,418 INFO L225 Difference]: With dead ends: 135 [2024-10-11 07:21:58,418 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 07:21:58,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-11 07:21:58,423 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 81 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 58 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-10-11 07:21:58,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 205 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 263 Invalid, 1 Unknown, 0 Unchecked, 8.6s Time] [2024-10-11 07:21:58,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 07:21:58,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2024-10-11 07:21:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 07:21:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2024-10-11 07:21:58,439 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 151 [2024-10-11 07:21:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:21:58,440 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2024-10-11 07:21:58,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-11 07:21:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2024-10-11 07:21:58,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 07:21:58,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:21:58,450 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:21:58,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 07:21:58,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-11 07:21:58,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 07:21:58,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:21:58,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:21:58,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1313888378, now seen corresponding path program 1 times [2024-10-11 07:21:58,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:21:58,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518635692] [2024-10-11 07:21:58,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:58,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:21:58,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:21:58,857 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:21:58,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 07:21:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:59,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 07:21:59,511 INFO L278 TraceCheckSpWp]: Computing forward predicates...