./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 06:29:07,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 06:29:07,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 06:29:07,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 06:29:07,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 06:29:07,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 06:29:07,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 06:29:07,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 06:29:07,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 06:29:07,167 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 06:29:07,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 06:29:07,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 06:29:07,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 06:29:07,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 06:29:07,169 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 06:29:07,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 06:29:07,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 06:29:07,169 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 06:29:07,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 06:29:07,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 06:29:07,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 06:29:07,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 06:29:07,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 06:29:07,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 06:29:07,175 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 06:29:07,176 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 06:29:07,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 06:29:07,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 06:29:07,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 06:29:07,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 06:29:07,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 06:29:07,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 06:29:07,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 06:29:07,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 06:29:07,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 06:29:07,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 06:29:07,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 06:29:07,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 06:29:07,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 06:29:07,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 06:29:07,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 06:29:07,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 06:29:07,182 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 [2024-11-22 06:29:07,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 06:29:07,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 06:29:07,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 06:29:07,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 06:29:07,456 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 06:29:07,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2024-11-22 06:29:08,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 06:29:08,971 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 06:29:08,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2024-11-22 06:29:08,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0e21ba75/0c9f41280c46498ebc8a9283217fd0fb/FLAGfa2d7c9a6 [2024-11-22 06:29:08,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0e21ba75/0c9f41280c46498ebc8a9283217fd0fb [2024-11-22 06:29:08,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 06:29:08,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 06:29:08,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 06:29:08,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 06:29:09,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 06:29:09,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:29:08" (1/1) ... [2024-11-22 06:29:09,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ac05758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:09, skipping insertion in model container [2024-11-22 06:29:09,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:29:08" (1/1) ... [2024-11-22 06:29:09,039 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 06:29:09,207 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i[913,926] [2024-11-22 06:29:09,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 06:29:09,299 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 06:29:09,312 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i[913,926] [2024-11-22 06:29:09,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 06:29:09,365 INFO L204 MainTranslator]: Completed translation [2024-11-22 06:29:09,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:09 WrapperNode [2024-11-22 06:29:09,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 06:29:09,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 06:29:09,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 06:29:09,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 06:29:09,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:09" (1/1) ... [2024-11-22 06:29:09,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:09" (1/1) ... [2024-11-22 06:29:09,411 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-22 06:29:09,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 06:29:09,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 06:29:09,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 06:29:09,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 06:29:09,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:09" (1/1) ... [2024-11-22 06:29:09,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:09" (1/1) ... [2024-11-22 06:29:09,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:09" (1/1) ... [2024-11-22 06:29:09,440 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 06:29:09,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:09" (1/1) ... [2024-11-22 06:29:09,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:09" (1/1) ... [2024-11-22 06:29:09,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:09" (1/1) ... [2024-11-22 06:29:09,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:09" (1/1) ... [2024-11-22 06:29:09,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:09" (1/1) ... [2024-11-22 06:29:09,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:09" (1/1) ... [2024-11-22 06:29:09,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 06:29:09,457 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 06:29:09,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 06:29:09,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 06:29:09,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:09" (1/1) ... [2024-11-22 06:29:09,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 06:29:09,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 06:29:09,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 06:29:09,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 06:29:09,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 06:29:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 06:29:09,521 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 06:29:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 06:29:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 06:29:09,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 06:29:09,572 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 06:29:09,574 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 06:29:09,832 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-22 06:29:09,833 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 06:29:09,845 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 06:29:09,845 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 06:29:09,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:29:09 BoogieIcfgContainer [2024-11-22 06:29:09,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 06:29:09,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 06:29:09,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 06:29:09,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 06:29:09,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:29:08" (1/3) ... [2024-11-22 06:29:09,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d9305a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:29:09, skipping insertion in model container [2024-11-22 06:29:09,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:09" (2/3) ... [2024-11-22 06:29:09,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d9305a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:29:09, skipping insertion in model container [2024-11-22 06:29:09,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:29:09" (3/3) ... [2024-11-22 06:29:09,853 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-59.i [2024-11-22 06:29:09,865 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 06:29:09,866 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 06:29:09,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 06:29:09,919 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;@5f1ab94d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 06:29:09,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 06:29:09,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 06:29:09,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-22 06:29:09,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:29:09,933 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:29:09,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:29:09,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:29:09,938 INFO L85 PathProgramCache]: Analyzing trace with hash -483950726, now seen corresponding path program 1 times [2024-11-22 06:29:09,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:29:09,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082445291] [2024-11-22 06:29:09,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:29:09,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:29:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:29:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-22 06:29:10,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 06:29:10,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082445291] [2024-11-22 06:29:10,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082445291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 06:29:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912592763] [2024-11-22 06:29:10,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:29:10,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 06:29:10,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 06:29:10,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 06:29:10,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 06:29:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:29:10,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 06:29:10,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:29:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-22 06:29:10,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 06:29:10,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912592763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:29:10,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 06:29:10,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 06:29:10,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598149234] [2024-11-22 06:29:10,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:29:10,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 06:29:10,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 06:29:10,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 06:29:10,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 06:29:10,509 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 06:29:10,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:29:10,529 INFO L93 Difference]: Finished difference Result 115 states and 200 transitions. [2024-11-22 06:29:10,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 06:29:10,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2024-11-22 06:29:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:29:10,539 INFO L225 Difference]: With dead ends: 115 [2024-11-22 06:29:10,540 INFO L226 Difference]: Without dead ends: 57 [2024-11-22 06:29:10,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 06:29:10,549 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 06:29:10,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 06:29:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-22 06:29:10,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-22 06:29:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 06:29:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2024-11-22 06:29:10,597 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 126 [2024-11-22 06:29:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:29:10,598 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2024-11-22 06:29:10,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 06:29:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2024-11-22 06:29:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-22 06:29:10,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:29:10,606 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:29:10,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 06:29:10,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 06:29:10,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:29:10,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:29:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash -709650890, now seen corresponding path program 1 times [2024-11-22 06:29:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:29:10,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448490988] [2024-11-22 06:29:10,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:29:10,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:29:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:29:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 06:29:11,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 06:29:11,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448490988] [2024-11-22 06:29:11,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448490988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:29:11,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:29:11,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 06:29:11,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380124316] [2024-11-22 06:29:11,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:29:11,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 06:29:11,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 06:29:11,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 06:29:11,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 06:29:11,193 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 06:29:11,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:29:11,248 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2024-11-22 06:29:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 06:29:11,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-11-22 06:29:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:29:11,253 INFO L225 Difference]: With dead ends: 134 [2024-11-22 06:29:11,253 INFO L226 Difference]: Without dead ends: 80 [2024-11-22 06:29:11,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 06:29:11,254 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 29 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 06:29:11,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 159 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 06:29:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-22 06:29:11,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-11-22 06:29:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 53 states have internal predecessors, (70), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-22 06:29:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2024-11-22 06:29:11,287 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 126 [2024-11-22 06:29:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:29:11,288 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2024-11-22 06:29:11,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 06:29:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2024-11-22 06:29:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-22 06:29:11,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:29:11,290 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:29:11,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 06:29:11,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:29:11,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:29:11,295 INFO L85 PathProgramCache]: Analyzing trace with hash -193170440, now seen corresponding path program 1 times [2024-11-22 06:29:11,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:29:11,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529764913] [2024-11-22 06:29:11,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:29:11,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:29:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 06:29:11,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914492680] [2024-11-22 06:29:11,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:29:11,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 06:29:11,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 06:29:11,432 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 06:29:11,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 06:29:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:29:11,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 06:29:11,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:29:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 435 proven. 114 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-11-22 06:29:12,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 06:29:15,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 06:29:15,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529764913] [2024-11-22 06:29:15,608 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 06:29:15,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914492680] [2024-11-22 06:29:15,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914492680] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 06:29:15,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-22 06:29:15,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-22 06:29:15,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560865749] [2024-11-22 06:29:15,613 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-22 06:29:15,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 06:29:15,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 06:29:15,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 06:29:15,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-11-22 06:29:15,621 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-22 06:29:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:29:16,488 INFO L93 Difference]: Finished difference Result 221 states and 304 transitions. [2024-11-22 06:29:16,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-22 06:29:16,489 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 127 [2024-11-22 06:29:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:29:16,492 INFO L225 Difference]: With dead ends: 221 [2024-11-22 06:29:16,492 INFO L226 Difference]: Without dead ends: 147 [2024-11-22 06:29:16,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=354, Invalid=836, Unknown=0, NotChecked=0, Total=1190 [2024-11-22 06:29:16,494 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 116 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 06:29:16,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 373 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 06:29:16,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-22 06:29:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 98. [2024-11-22 06:29:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 70 states have internal predecessors, (88), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-22 06:29:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2024-11-22 06:29:16,512 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 127 [2024-11-22 06:29:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:29:16,514 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2024-11-22 06:29:16,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-22 06:29:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2024-11-22 06:29:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-22 06:29:16,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:29:16,515 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:29:16,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 06:29:16,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-22 06:29:16,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:29:16,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:29:16,720 INFO L85 PathProgramCache]: Analyzing trace with hash 486887930, now seen corresponding path program 1 times [2024-11-22 06:29:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:29:16,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746816704] [2024-11-22 06:29:16,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:29:16,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:29:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:29:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 06:29:16,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 06:29:16,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746816704] [2024-11-22 06:29:16,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746816704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:29:16,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:29:16,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 06:29:16,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986515716] [2024-11-22 06:29:16,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:29:16,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 06:29:16,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 06:29:16,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 06:29:16,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 06:29:16,796 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 06:29:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:29:16,827 INFO L93 Difference]: Finished difference Result 195 states and 258 transitions. [2024-11-22 06:29:16,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 06:29:16,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-11-22 06:29:16,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:29:16,830 INFO L225 Difference]: With dead ends: 195 [2024-11-22 06:29:16,831 INFO L226 Difference]: Without dead ends: 100 [2024-11-22 06:29:16,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 06:29:16,833 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 19 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 06:29:16,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 162 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 06:29:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-22 06:29:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2024-11-22 06:29:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 58 states have internal predecessors, (66), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-22 06:29:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2024-11-22 06:29:16,849 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 127 [2024-11-22 06:29:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:29:16,849 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2024-11-22 06:29:16,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 06:29:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2024-11-22 06:29:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-22 06:29:16,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:29:16,851 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:29:16,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 06:29:16,851 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:29:16,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:29:16,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2030045565, now seen corresponding path program 1 times [2024-11-22 06:29:16,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:29:16,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307430918] [2024-11-22 06:29:16,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:29:16,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:29:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 06:29:16,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [696448006] [2024-11-22 06:29:16,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:29:16,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 06:29:16,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 06:29:16,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 06:29:16,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 06:29:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 06:29:17,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 06:29:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 06:29:17,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 06:29:17,310 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 06:29:17,311 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 06:29:17,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 06:29:17,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 06:29:17,521 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-22 06:29:17,611 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 06:29:17,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 06:29:17 BoogieIcfgContainer [2024-11-22 06:29:17,613 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 06:29:17,614 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 06:29:17,614 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 06:29:17,614 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 06:29:17,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:29:09" (3/4) ... [2024-11-22 06:29:17,617 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 06:29:17,618 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 06:29:17,619 INFO L158 Benchmark]: Toolchain (without parser) took 8622.40ms. Allocated memory was 161.5MB in the beginning and 257.9MB in the end (delta: 96.5MB). Free memory was 106.4MB in the beginning and 114.8MB in the end (delta: -8.4MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2024-11-22 06:29:17,619 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory was 57.1MB in the beginning and 56.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 06:29:17,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.68ms. Allocated memory is still 161.5MB. Free memory was 106.4MB in the beginning and 125.7MB in the end (delta: -19.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 06:29:17,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.85ms. Allocated memory is still 161.5MB. Free memory was 125.7MB in the beginning and 121.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 06:29:17,619 INFO L158 Benchmark]: Boogie Preprocessor took 43.58ms. Allocated memory is still 161.5MB. Free memory was 121.5MB in the beginning and 114.9MB in the end (delta: 6.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 06:29:17,620 INFO L158 Benchmark]: RCFGBuilder took 389.23ms. Allocated memory is still 161.5MB. Free memory was 114.9MB in the beginning and 92.7MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-22 06:29:17,620 INFO L158 Benchmark]: TraceAbstraction took 7766.15ms. Allocated memory was 161.5MB in the beginning and 257.9MB in the end (delta: 96.5MB). Free memory was 92.2MB in the beginning and 115.8MB in the end (delta: -23.6MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. [2024-11-22 06:29:17,620 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 257.9MB. Free memory was 115.8MB in the beginning and 114.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 06:29:17,621 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.19ms. Allocated memory is still 102.8MB. Free memory was 57.1MB in the beginning and 56.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.68ms. Allocated memory is still 161.5MB. Free memory was 106.4MB in the beginning and 125.7MB in the end (delta: -19.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.85ms. Allocated memory is still 161.5MB. Free memory was 125.7MB in the beginning and 121.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.58ms. Allocated memory is still 161.5MB. Free memory was 121.5MB in the beginning and 114.9MB in the end (delta: 6.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 389.23ms. Allocated memory is still 161.5MB. Free memory was 114.9MB in the beginning and 92.7MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7766.15ms. Allocated memory was 161.5MB in the beginning and 257.9MB in the end (delta: 96.5MB). Free memory was 92.2MB in the beginning and 115.8MB in the end (delta: -23.6MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 257.9MB. Free memory was 115.8MB in the beginning and 114.8MB 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 someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 100; [L25] unsigned char var_1_4 = 25; [L26] unsigned short int var_1_5 = 0; [L27] unsigned short int var_1_6 = 62100; [L28] unsigned short int var_1_7 = 27651; [L29] double var_1_8 = 128.9; [L30] unsigned char var_1_9 = 1; [L31] double var_1_10 = 16.5; [L32] double var_1_11 = 25.5; [L33] double var_1_12 = 199.75; [L34] unsigned char var_1_13 = 2; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 1; [L37] unsigned char var_1_16 = 1; [L38] unsigned short int var_1_17 = 32; [L39] unsigned char var_1_18 = 1; [L40] unsigned long int var_1_19 = 1; VAL [isInitial=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] FCALL updateLastVariables() [L135] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L93] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L94] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L95] var_1_3 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L96] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L97] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L99] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L100] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L101] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L102] var_1_6 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L103] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L104] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L105] var_1_7 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L106] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L107] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L107] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L108] var_1_9 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10] [L109] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10] [L110] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L110] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L111] var_1_10 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L112] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L113] var_1_11 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L114] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L115] var_1_12 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L116] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L117] var_1_14 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L118] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L119] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L120] var_1_16 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L121] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L122] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L135] RET updateVariables() [L136] CALL step() [L44] COND FALSE !((var_1_3 != (16 / var_1_4)) && var_1_2) [L55] var_1_1 = var_1_3 VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=3, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L57] COND FALSE !(var_1_1 < var_1_3) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=3, var_1_4=2, var_1_5=0, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L60] COND TRUE ! var_1_2 [L61] var_1_5 = ((((var_1_3) > ((var_1_7 + var_1_4))) ? (var_1_3) : ((var_1_7 + var_1_4)))) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=3, var_1_4=2, var_1_5=16385, var_1_6=32770, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L64] COND FALSE !(\read(var_1_2)) [L71] var_1_8 = var_1_11 VAL [isInitial=1, var_1_11=2, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=3, var_1_4=2, var_1_5=16385, var_1_6=32770, var_1_7=-49153, var_1_8=2, var_1_9=1] [L73] COND TRUE var_1_3 != ((var_1_6 / var_1_4) * ((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5)))) VAL [isInitial=1, var_1_11=2, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=3, var_1_4=2, var_1_5=16385, var_1_6=32770, var_1_7=-49153, var_1_8=2, var_1_9=1] [L74] COND TRUE var_1_3 <= var_1_6 [L75] var_1_13 = 32 VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=3, var_1_4=2, var_1_5=16385, var_1_6=32770, var_1_7=-49153, var_1_8=2, var_1_9=1] [L82] COND TRUE var_1_12 != var_1_8 [L83] var_1_15 = (! var_1_16) VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=3, var_1_2=0, var_1_3=3, var_1_4=2, var_1_5=16385, var_1_6=32770, var_1_7=-49153, var_1_8=2, var_1_9=1] [L87] var_1_17 = var_1_4 [L88] var_1_18 = var_1_16 [L89] var_1_19 = var_1_4 VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=2, var_1_18=1, var_1_19=2, var_1_1=3, var_1_2=0, var_1_3=3, var_1_4=2, var_1_5=16385, var_1_6=32770, var_1_7=-49153, var_1_8=2, var_1_9=1] [L136] RET step() [L137] CALL, EXPR property() [L127-L128] return (((((((((var_1_3 != (16 / var_1_4)) && var_1_2) ? ((var_1_3 > var_1_4) ? (var_1_1 == ((unsigned short int) (var_1_4 + var_1_3))) : (var_1_2 ? (var_1_1 == ((unsigned short int) var_1_3)) : (var_1_1 == ((unsigned short int) var_1_4)))) : (var_1_1 == ((unsigned short int) var_1_3))) && ((var_1_1 < var_1_3) ? (var_1_5 == ((unsigned short int) (var_1_6 - (var_1_7 - var_1_3)))) : ((! var_1_2) ? (var_1_5 == ((unsigned short int) ((((var_1_3) > ((var_1_7 + var_1_4))) ? (var_1_3) : ((var_1_7 + var_1_4)))))) : 1))) && (var_1_2 ? (((! var_1_9) || (var_1_5 < var_1_6)) ? (var_1_8 == ((double) ((((127.25) > (var_1_10)) ? (127.25) : (var_1_10))))) : (var_1_8 == ((double) (var_1_11 + var_1_12)))) : (var_1_8 == ((double) var_1_11)))) && ((var_1_3 != ((var_1_6 / var_1_4) * ((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))))) ? ((var_1_3 <= var_1_6) ? (var_1_13 == ((unsigned char) 32)) : (var_1_13 == ((unsigned char) var_1_14))) : (var_1_13 == ((unsigned char) var_1_14)))) && ((var_1_12 != var_1_8) ? (var_1_15 == ((unsigned char) (! var_1_16))) : (var_1_15 == ((unsigned char) var_1_16)))) && (var_1_17 == ((unsigned short int) var_1_4))) && (var_1_18 == ((unsigned char) var_1_16))) && (var_1_19 == ((unsigned long int) var_1_4)) ; VAL [\result=0, isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=2, var_1_18=1, var_1_19=2, var_1_1=3, var_1_2=0, var_1_3=3, var_1_4=2, var_1_5=16385, var_1_6=32770, var_1_7=-49153, var_1_8=2, var_1_9=1] [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=2, var_1_18=1, var_1_19=2, var_1_1=3, var_1_2=0, var_1_3=3, var_1_4=2, var_1_5=16385, var_1_6=32770, var_1_7=-49153, var_1_8=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=2, var_1_18=1, var_1_19=2, var_1_1=3, var_1_2=0, var_1_3=3, var_1_4=2, var_1_5=16385, var_1_6=32770, var_1_7=-49153, var_1_8=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 780 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 443 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 613 IncrementalHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 337 mSDtfsCounter, 613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=3, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 66 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1015 NumberOfCodeBlocks, 1015 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 627 ConstructedInterpolants, 0 QuantifiedInterpolants, 2142 SizeOfPredicates, 6 NumberOfNonLiveVariables, 588 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 3648/3800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 06:29:17,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 06:29:19,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 06:29:19,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 06:29:19,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 06:29:19,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 06:29:19,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 06:29:19,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 06:29:19,923 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 06:29:19,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 06:29:19,924 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 06:29:19,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 06:29:19,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 06:29:19,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 06:29:19,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 06:29:19,925 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 06:29:19,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 06:29:19,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 06:29:19,926 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 06:29:19,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 06:29:19,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 06:29:19,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 06:29:19,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 06:29:19,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 06:29:19,930 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 06:29:19,932 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 06:29:19,932 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 06:29:19,932 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 06:29:19,932 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 06:29:19,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 06:29:19,933 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 06:29:19,933 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 06:29:19,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 06:29:19,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 06:29:19,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 06:29:19,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 06:29:19,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 06:29:19,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 06:29:19,934 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 06:29:19,935 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 06:29:19,935 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 06:29:19,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 06:29:19,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 06:29:19,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 06:29:19,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 06:29:19,936 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 [2024-11-22 06:29:20,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 06:29:20,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 06:29:20,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 06:29:20,257 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 06:29:20,258 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 06:29:20,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2024-11-22 06:29:21,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 06:29:22,102 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 06:29:22,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2024-11-22 06:29:22,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c35791b4f/9a190de1264146179f599590f4b86a9b/FLAGc2684b74f [2024-11-22 06:29:22,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c35791b4f/9a190de1264146179f599590f4b86a9b [2024-11-22 06:29:22,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 06:29:22,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 06:29:22,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 06:29:22,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 06:29:22,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 06:29:22,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:29:22" (1/1) ... [2024-11-22 06:29:22,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f5fc79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:22, skipping insertion in model container [2024-11-22 06:29:22,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:29:22" (1/1) ... [2024-11-22 06:29:22,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 06:29:22,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i[913,926] [2024-11-22 06:29:22,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 06:29:22,740 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 06:29:22,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i[913,926] [2024-11-22 06:29:22,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 06:29:22,799 INFO L204 MainTranslator]: Completed translation [2024-11-22 06:29:22,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:22 WrapperNode [2024-11-22 06:29:22,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 06:29:22,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 06:29:22,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 06:29:22,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 06:29:22,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:22" (1/1) ... [2024-11-22 06:29:22,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:22" (1/1) ... [2024-11-22 06:29:22,858 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-22 06:29:22,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 06:29:22,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 06:29:22,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 06:29:22,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 06:29:22,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:22" (1/1) ... [2024-11-22 06:29:22,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:22" (1/1) ... [2024-11-22 06:29:22,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:22" (1/1) ... [2024-11-22 06:29:22,915 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 06:29:22,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:22" (1/1) ... [2024-11-22 06:29:22,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:22" (1/1) ... [2024-11-22 06:29:22,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:22" (1/1) ... [2024-11-22 06:29:22,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:22" (1/1) ... [2024-11-22 06:29:22,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:22" (1/1) ... [2024-11-22 06:29:22,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:22" (1/1) ... [2024-11-22 06:29:22,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 06:29:22,944 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 06:29:22,944 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 06:29:22,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 06:29:22,945 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:22" (1/1) ... [2024-11-22 06:29:22,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 06:29:22,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 06:29:22,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 06:29:22,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 06:29:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 06:29:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 06:29:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 06:29:23,013 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 06:29:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 06:29:23,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 06:29:23,081 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 06:29:23,083 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 06:29:23,721 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-22 06:29:23,722 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 06:29:23,730 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 06:29:23,731 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 06:29:23,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:29:23 BoogieIcfgContainer [2024-11-22 06:29:23,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 06:29:23,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 06:29:23,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 06:29:23,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 06:29:23,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:29:22" (1/3) ... [2024-11-22 06:29:23,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658feb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:29:23, skipping insertion in model container [2024-11-22 06:29:23,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:29:22" (2/3) ... [2024-11-22 06:29:23,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658feb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:29:23, skipping insertion in model container [2024-11-22 06:29:23,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:29:23" (3/3) ... [2024-11-22 06:29:23,737 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-59.i [2024-11-22 06:29:23,749 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 06:29:23,749 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 06:29:23,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 06:29:23,804 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;@36453984, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 06:29:23,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 06:29:23,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 06:29:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-22 06:29:23,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:29:23,817 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:29:23,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:29:23,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:29:23,821 INFO L85 PathProgramCache]: Analyzing trace with hash -483950726, now seen corresponding path program 1 times [2024-11-22 06:29:23,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 06:29:23,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581538326] [2024-11-22 06:29:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:29:23,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:29:23,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 06:29:23,870 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 06:29:23,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 06:29:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:29:24,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 06:29:24,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:29:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-22 06:29:24,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 06:29:24,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 06:29:24,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581538326] [2024-11-22 06:29:24,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581538326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:29:24,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:29:24,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 06:29:24,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599651777] [2024-11-22 06:29:24,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:29:24,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 06:29:24,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 06:29:24,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 06:29:24,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 06:29:24,131 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 06:29:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:29:24,149 INFO L93 Difference]: Finished difference Result 115 states and 200 transitions. [2024-11-22 06:29:24,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 06:29:24,152 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2024-11-22 06:29:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:29:24,161 INFO L225 Difference]: With dead ends: 115 [2024-11-22 06:29:24,161 INFO L226 Difference]: Without dead ends: 57 [2024-11-22 06:29:24,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 06:29:24,166 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 06:29:24,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 06:29:24,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-22 06:29:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-22 06:29:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 06:29:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2024-11-22 06:29:24,197 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 126 [2024-11-22 06:29:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:29:24,198 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2024-11-22 06:29:24,198 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 06:29:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2024-11-22 06:29:24,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-22 06:29:24,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:29:24,201 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:29:24,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 06:29:24,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:29:24,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:29:24,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:29:24,403 INFO L85 PathProgramCache]: Analyzing trace with hash -709650890, now seen corresponding path program 1 times [2024-11-22 06:29:24,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 06:29:24,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349155295] [2024-11-22 06:29:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:29:24,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:29:24,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 06:29:24,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 06:29:24,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 06:29:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:29:24,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 06:29:24,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:29:24,667 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 06:29:24,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 06:29:24,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 06:29:24,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349155295] [2024-11-22 06:29:24,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349155295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:29:24,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:29:24,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 06:29:24,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354399536] [2024-11-22 06:29:24,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:29:24,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 06:29:24,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 06:29:24,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 06:29:24,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 06:29:24,673 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 06:29:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:29:25,569 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2024-11-22 06:29:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 06:29:25,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-11-22 06:29:25,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:29:25,572 INFO L225 Difference]: With dead ends: 134 [2024-11-22 06:29:25,572 INFO L226 Difference]: Without dead ends: 80 [2024-11-22 06:29:25,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 06:29:25,574 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 29 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 06:29:25,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 174 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 06:29:25,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-22 06:29:25,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-11-22 06:29:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 53 states have internal predecessors, (70), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-22 06:29:25,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2024-11-22 06:29:25,587 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 126 [2024-11-22 06:29:25,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:29:25,588 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2024-11-22 06:29:25,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 06:29:25,588 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2024-11-22 06:29:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-22 06:29:25,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:29:25,590 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:29:25,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 06:29:25,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:29:25,792 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:29:25,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:29:25,793 INFO L85 PathProgramCache]: Analyzing trace with hash 988947254, now seen corresponding path program 1 times [2024-11-22 06:29:25,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 06:29:25,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95131313] [2024-11-22 06:29:25,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:29:25,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:29:25,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 06:29:25,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 06:29:25,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 06:29:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:29:25,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 06:29:25,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:29:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 06:29:26,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 06:29:26,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 06:29:26,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95131313] [2024-11-22 06:29:26,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95131313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:29:26,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:29:26,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 06:29:26,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887372861] [2024-11-22 06:29:26,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:29:26,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 06:29:26,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 06:29:26,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 06:29:26,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 06:29:26,020 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 06:29:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:29:26,296 INFO L93 Difference]: Finished difference Result 168 states and 247 transitions. [2024-11-22 06:29:26,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 06:29:26,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-11-22 06:29:26,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:29:26,299 INFO L225 Difference]: With dead ends: 168 [2024-11-22 06:29:26,300 INFO L226 Difference]: Without dead ends: 94 [2024-11-22 06:29:26,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 06:29:26,301 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 20 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 06:29:26,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 166 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 06:29:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-22 06:29:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2024-11-22 06:29:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 56 states have internal predecessors, (70), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-22 06:29:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2024-11-22 06:29:26,318 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 127 [2024-11-22 06:29:26,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:29:26,319 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2024-11-22 06:29:26,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 06:29:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2024-11-22 06:29:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-22 06:29:26,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:29:26,334 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:29:26,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 06:29:26,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:29:26,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:29:26,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:29:26,539 INFO L85 PathProgramCache]: Analyzing trace with hash -193170440, now seen corresponding path program 1 times [2024-11-22 06:29:26,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 06:29:26,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815717025] [2024-11-22 06:29:26,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:29:26,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:29:26,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 06:29:26,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 06:29:26,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 06:29:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:29:26,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 06:29:26,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:29:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 435 proven. 114 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-11-22 06:29:28,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 06:29:53,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 06:29:53,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815717025] [2024-11-22 06:29:53,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815717025] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 06:29:53,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1455898841] [2024-11-22 06:29:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:29:53,545 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 06:29:53,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 06:29:53,551 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 06:29:53,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-22 06:29:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:29:54,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 06:29:54,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:30:44,252 WARN L286 SmtUtils]: Spent 6.35s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)