./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.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 7ec09e5648980bc5a4329f49d7e2504b195b194638f2d82967f3c7db0031611d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:58:05,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:58:06,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:58:06,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:58:06,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:58:06,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:58:06,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:58:06,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:58:06,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:58:06,099 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:58:06,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:58:06,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:58:06,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:58:06,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:58:06,101 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:58:06,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:58:06,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:58:06,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:58:06,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:58:06,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:58:06,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:58:06,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:58:06,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:58:06,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:58:06,108 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:58:06,108 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:58:06,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:58:06,109 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:58:06,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:58:06,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:58:06,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:58:06,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:58:06,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:58:06,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:58:06,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:58:06,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:58:06,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:58:06,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:58:06,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:58:06,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:58:06,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:58:06,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:58:06,114 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 -> 7ec09e5648980bc5a4329f49d7e2504b195b194638f2d82967f3c7db0031611d [2024-11-12 06:58:06,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:58:06,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:58:06,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:58:06,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:58:06,436 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:58:06,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i [2024-11-12 06:58:07,867 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:58:08,090 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:58:08,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i [2024-11-12 06:58:08,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e05e21a/30353f2e30cb4a9798958b39fa01dc6a/FLAG4a3f01254 [2024-11-12 06:58:08,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e05e21a/30353f2e30cb4a9798958b39fa01dc6a [2024-11-12 06:58:08,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:58:08,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:58:08,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:58:08,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:58:08,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:58:08,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:58:08" (1/1) ... [2024-11-12 06:58:08,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e83d897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:08, skipping insertion in model container [2024-11-12 06:58:08,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:58:08" (1/1) ... [2024-11-12 06:58:08,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:58:08,358 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_variablewrapping_normal_file-35.i[913,926] [2024-11-12 06:58:08,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:58:08,414 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:58:08,425 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_variablewrapping_normal_file-35.i[913,926] [2024-11-12 06:58:08,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:58:08,460 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:58:08,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:08 WrapperNode [2024-11-12 06:58:08,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:58:08,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:58:08,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:58:08,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:58:08,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:08" (1/1) ... [2024-11-12 06:58:08,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:08" (1/1) ... [2024-11-12 06:58:08,505 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-12 06:58:08,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:58:08,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:58:08,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:58:08,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:58:08,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:08" (1/1) ... [2024-11-12 06:58:08,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:08" (1/1) ... [2024-11-12 06:58:08,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:08" (1/1) ... [2024-11-12 06:58:08,540 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:58:08,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:08" (1/1) ... [2024-11-12 06:58:08,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:08" (1/1) ... [2024-11-12 06:58:08,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:08" (1/1) ... [2024-11-12 06:58:08,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:08" (1/1) ... [2024-11-12 06:58:08,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:08" (1/1) ... [2024-11-12 06:58:08,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:08" (1/1) ... [2024-11-12 06:58:08,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:58:08,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:58:08,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:58:08,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:58:08,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:08" (1/1) ... [2024-11-12 06:58:08,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:58:08,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:58:08,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:58:08,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:58:08,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:58:08,671 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:58:08,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:58:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:58:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:58:08,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:58:08,756 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:58:08,759 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:58:09,038 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 06:58:09,038 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:58:09,055 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:58:09,056 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:58:09,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:58:09 BoogieIcfgContainer [2024-11-12 06:58:09,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:58:09,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:58:09,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:58:09,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:58:09,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:58:08" (1/3) ... [2024-11-12 06:58:09,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b80a567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:58:09, skipping insertion in model container [2024-11-12 06:58:09,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:08" (2/3) ... [2024-11-12 06:58:09,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b80a567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:58:09, skipping insertion in model container [2024-11-12 06:58:09,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:58:09" (3/3) ... [2024-11-12 06:58:09,066 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-35.i [2024-11-12 06:58:09,083 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:58:09,083 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:58:09,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:58:09,178 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;@9d57883, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:58:09,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:58:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:58:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 06:58:09,197 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:09,199 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:09,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:09,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:09,206 INFO L85 PathProgramCache]: Analyzing trace with hash -232387294, now seen corresponding path program 1 times [2024-11-12 06:58:09,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:09,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071847479] [2024-11-12 06:58:09,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:09,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:58:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 06:58:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 06:58:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 06:58:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:58:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:58:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:58:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:58:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:58:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:58:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:58:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:58:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:58:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 06:58:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:58:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 06:58:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 06:58:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 06:58:09,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:09,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071847479] [2024-11-12 06:58:09,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071847479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:09,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:09,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:58:09,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227232313] [2024-11-12 06:58:09,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:09,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:58:09,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:09,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:58:09,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:58:09,641 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 06:58:09,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:09,672 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2024-11-12 06:58:09,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:58:09,675 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-11-12 06:58:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:09,682 INFO L225 Difference]: With dead ends: 101 [2024-11-12 06:58:09,683 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 06:58:09,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:58:09,693 INFO L435 NwaCegarLoop]: 73 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, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:09,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:58:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 06:58:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-12 06:58:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:58:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-12 06:58:09,793 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 115 [2024-11-12 06:58:09,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:09,794 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-12 06:58:09,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 06:58:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-12 06:58:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 06:58:09,801 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:09,802 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:09,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:58:09,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:09,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1342920990, now seen corresponding path program 1 times [2024-11-12 06:58:09,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:09,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296858476] [2024-11-12 06:58:09,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:09,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:58:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 06:58:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 06:58:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 06:58:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:58:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:58:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:58:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:58:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:58:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:58:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:58:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:58:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:58:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 06:58:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:58:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 06:58:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 06:58:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,139 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 06:58:10,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:10,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296858476] [2024-11-12 06:58:10,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296858476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:10,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:10,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:58:10,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525996374] [2024-11-12 06:58:10,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:10,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:58:10,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:10,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:58:10,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:58:10,143 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:10,210 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions. [2024-11-12 06:58:10,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:58:10,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-12 06:58:10,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:10,216 INFO L225 Difference]: With dead ends: 142 [2024-11-12 06:58:10,219 INFO L226 Difference]: Without dead ends: 95 [2024-11-12 06:58:10,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-12 06:58:10,222 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 66 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:10,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 136 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:58:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-12 06:58:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 51. [2024-11-12 06:58:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:58:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-12 06:58:10,247 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 115 [2024-11-12 06:58:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:10,251 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-12 06:58:10,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-12 06:58:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 06:58:10,256 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:10,256 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:10,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:58:10,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:10,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:10,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1400179292, now seen corresponding path program 1 times [2024-11-12 06:58:10,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:10,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257949948] [2024-11-12 06:58:10,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:10,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:58:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 06:58:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 06:58:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 06:58:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:58:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:58:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:58:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:58:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:58:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:58:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:58:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:58:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:58:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 06:58:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:58:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 06:58:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 06:58:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 06:58:10,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:10,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257949948] [2024-11-12 06:58:10,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257949948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:10,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:10,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:58:10,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677072368] [2024-11-12 06:58:10,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:10,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:58:10,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:10,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:58:10,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:58:10,517 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:10,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:10,545 INFO L93 Difference]: Finished difference Result 99 states and 143 transitions. [2024-11-12 06:58:10,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:58:10,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-12 06:58:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:10,549 INFO L225 Difference]: With dead ends: 99 [2024-11-12 06:58:10,549 INFO L226 Difference]: Without dead ends: 51 [2024-11-12 06:58:10,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-12 06:58:10,552 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:10,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:58:10,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-12 06:58:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-12 06:58:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:58:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2024-11-12 06:58:10,564 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 115 [2024-11-12 06:58:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:10,565 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2024-11-12 06:58:10,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2024-11-12 06:58:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 06:58:10,570 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:10,570 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:10,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:58:10,570 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:10,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1793206302, now seen corresponding path program 1 times [2024-11-12 06:58:10,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:10,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010048384] [2024-11-12 06:58:10,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:10,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:58:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:58:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 06:58:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 06:58:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 06:58:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:58:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:58:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:58:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:58:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:58:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:58:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:58:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:58:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:58:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 06:58:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:58:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 06:58:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 06:58:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-12 06:58:11,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:58:11,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010048384] [2024-11-12 06:58:11,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010048384] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 06:58:11,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984035217] [2024-11-12 06:58:11,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:11,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:58:11,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:58:11,225 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 06:58:11,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 06:58:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:11,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 06:58:11,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:58:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 303 proven. 18 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 06:58:11,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:58:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-12 06:58:11,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984035217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 06:58:11,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 06:58:11,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-12 06:58:11,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645351790] [2024-11-12 06:58:11,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 06:58:11,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 06:58:11,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:58:11,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 06:58:11,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-12 06:58:11,741 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 06:58:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:12,290 INFO L93 Difference]: Finished difference Result 214 states and 292 transitions. [2024-11-12 06:58:12,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 06:58:12,290 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 115 [2024-11-12 06:58:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:12,292 INFO L225 Difference]: With dead ends: 214 [2024-11-12 06:58:12,292 INFO L226 Difference]: Without dead ends: 166 [2024-11-12 06:58:12,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2024-11-12 06:58:12,294 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 235 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:12,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 183 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 06:58:12,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-12 06:58:12,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 56. [2024-11-12 06:58:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:58:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2024-11-12 06:58:12,312 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 115 [2024-11-12 06:58:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:12,312 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-11-12 06:58:12,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 06:58:12,313 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-11-12 06:58:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 06:58:12,316 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:12,317 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:12,334 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-12 06:58:12,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:58:12,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:12,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:12,519 INFO L85 PathProgramCache]: Analyzing trace with hash -726753632, now seen corresponding path program 1 times [2024-11-12 06:58:12,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:58:12,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464737223] [2024-11-12 06:58:12,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:12,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:58:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:58:12,574 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:58:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:58:12,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:58:12,648 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:58:12,649 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:58:12,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 06:58:12,653 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 06:58:12,747 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:58:12,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:58:12 BoogieIcfgContainer [2024-11-12 06:58:12,751 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:58:12,752 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:58:12,752 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:58:12,752 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:58:12,753 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:58:09" (3/4) ... [2024-11-12 06:58:12,755 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:58:12,756 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:58:12,757 INFO L158 Benchmark]: Toolchain (without parser) took 4643.50ms. Allocated memory was 125.8MB in the beginning and 230.7MB in the end (delta: 104.9MB). Free memory was 56.2MB in the beginning and 144.2MB in the end (delta: -88.0MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-12 06:58:12,757 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 125.8MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:58:12,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.43ms. Allocated memory was 125.8MB in the beginning and 180.4MB in the end (delta: 54.5MB). Free memory was 55.8MB in the beginning and 145.0MB in the end (delta: -89.2MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-11-12 06:58:12,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.21ms. Allocated memory is still 180.4MB. Free memory was 145.0MB in the beginning and 142.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:58:12,758 INFO L158 Benchmark]: Boogie Preprocessor took 57.92ms. Allocated memory is still 180.4MB. Free memory was 142.9MB in the beginning and 139.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 06:58:12,758 INFO L158 Benchmark]: RCFGBuilder took 490.58ms. Allocated memory is still 180.4MB. Free memory was 139.8MB in the beginning and 121.7MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 06:58:12,759 INFO L158 Benchmark]: TraceAbstraction took 3692.87ms. Allocated memory was 180.4MB in the beginning and 230.7MB in the end (delta: 50.3MB). Free memory was 121.7MB in the beginning and 144.2MB in the end (delta: -22.5MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2024-11-12 06:58:12,759 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 230.7MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:58:12,760 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 125.8MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.43ms. Allocated memory was 125.8MB in the beginning and 180.4MB in the end (delta: 54.5MB). Free memory was 55.8MB in the beginning and 145.0MB in the end (delta: -89.2MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.21ms. Allocated memory is still 180.4MB. Free memory was 145.0MB in the beginning and 142.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.92ms. Allocated memory is still 180.4MB. Free memory was 142.9MB in the beginning and 139.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 490.58ms. Allocated memory is still 180.4MB. Free memory was 139.8MB in the beginning and 121.7MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3692.87ms. Allocated memory was 180.4MB in the beginning and 230.7MB in the end (delta: 50.3MB). Free memory was 121.7MB in the beginning and 144.2MB in the end (delta: -22.5MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 230.7MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 4.8; [L23] float var_1_4 = 255.1; [L24] float var_1_5 = -0.6; [L25] signed short int var_1_6 = -10; [L26] unsigned char var_1_8 = 1; [L27] signed char var_1_11 = -2; [L28] signed char var_1_12 = 10; [L29] signed char var_1_13 = 5; [L30] signed char var_1_14 = -1; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 0; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 5; [L35] unsigned char var_1_19 = 64; [L36] unsigned char var_1_20 = 5; [L37] unsigned char last_1_var_1_18 = 5; VAL [isInitial=0, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_4=2551/10, var_1_6=-10, var_1_8=1] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_4=2551/10, var_1_6=-10, var_1_8=1] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L70] var_1_4 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L71] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L72] var_1_5 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L73] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L74] var_1_8 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10] [L75] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10] [L76] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L76] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L77] var_1_12 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L78] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L79] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L79] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L80] var_1_13 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L81] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L82] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L83] var_1_14 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L84] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L85] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L86] var_1_16 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L87] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L88] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L88] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L89] var_1_17 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L90] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L91] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L91] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L92] var_1_19 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_19 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8128, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8128, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L93] RET assume_abort_if_not(var_1_19 >= 32) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8128, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L94] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8128, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8128, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L94] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8128, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L95] var_1_20 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8128, var_1_1=24/5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8128, var_1_1=24/5, var_1_6=-10, var_1_8=0] [L96] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8128, var_1_1=24/5, var_1_6=-10, var_1_8=0] [L97] CALL assume_abort_if_not(var_1_20 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8128, var_1_1=24/5, var_1_20=32, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8128, var_1_1=24/5, var_1_20=32, var_1_6=-10, var_1_8=0] [L97] RET assume_abort_if_not(var_1_20 <= 32) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8128, var_1_1=24/5, var_1_20=32, var_1_6=-10, var_1_8=0] [L111] RET updateVariables() [L112] CALL step() [L41] signed long int stepLocal_0 = ~ last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=5, stepLocal_0=-6, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8128, var_1_1=24/5, var_1_20=32, var_1_6=-10, var_1_8=0] [L42] COND TRUE last_1_var_1_18 >= stepLocal_0 [L43] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8128, var_1_20=32, var_1_6=-10, var_1_8=0] [L45] unsigned char stepLocal_1 = (var_1_1 * var_1_5) >= var_1_4; VAL [isInitial=1, last_1_var_1_18=5, stepLocal_1=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8128, var_1_20=32, var_1_6=-10, var_1_8=0] [L46] COND TRUE var_1_17 && stepLocal_1 [L47] var_1_18 = (2 + ((var_1_19 - var_1_20) + 32)) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=-8128, var_1_20=32, var_1_6=-10, var_1_8=0] [L51] COND FALSE !(\read(var_1_8)) [L54] var_1_15 = (! var_1_17) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=-8128, var_1_20=32, var_1_6=-10, var_1_8=0] [L56] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=-8128, var_1_20=32, var_1_6=-10, var_1_8=0] [L59] COND FALSE !(\read(var_1_15)) [L66] var_1_6 = var_1_11 VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=-8128, var_1_20=32, var_1_6=-2, var_1_8=0] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((((last_1_var_1_18 >= (~ last_1_var_1_18)) ? (var_1_1 == ((float) (var_1_4 + var_1_5))) : 1) && (var_1_15 ? (var_1_15 ? (var_1_6 == ((signed short int) (var_1_11 + var_1_11))) : (var_1_6 == ((signed short int) (var_1_11 + var_1_11)))) : (var_1_6 == ((signed short int) var_1_11)))) && (var_1_15 ? (var_1_11 == ((signed char) ((var_1_12 + ((((10) < (var_1_13)) ? (10) : (var_1_13)))) + var_1_14))) : 1)) && (var_1_8 ? (var_1_15 == ((unsigned char) (! var_1_16))) : (var_1_15 == ((unsigned char) (! var_1_17))))) && ((var_1_17 && ((var_1_1 * var_1_5) >= var_1_4)) ? (var_1_18 == ((unsigned char) (2 + ((var_1_19 - var_1_20) + 32)))) : (var_1_18 == ((unsigned char) var_1_19))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=-8128, var_1_20=32, var_1_6=-2, var_1_8=0] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=-8128, var_1_20=32, var_1_6=-2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-43, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=-8128, var_1_20=32, var_1_6=-2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 528 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 201 IncrementalHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 270 mSDtfsCounter, 201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=4, InterpolantAutomatonStates: 33, 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, 154 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 1019 SizeOfPredicates, 2 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 3618/3672 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 06:58:12,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.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 7ec09e5648980bc5a4329f49d7e2504b195b194638f2d82967f3c7db0031611d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:58:15,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:58:15,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:58:15,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:58:15,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:58:15,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:58:15,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:58:15,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:58:15,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:58:15,177 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:58:15,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:58:15,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:58:15,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:58:15,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:58:15,181 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:58:15,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:58:15,182 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:58:15,182 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:58:15,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:58:15,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:58:15,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:58:15,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:58:15,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:58:15,187 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:58:15,188 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:58:15,188 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:58:15,188 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:58:15,188 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:58:15,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:58:15,189 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:58:15,189 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:58:15,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:58:15,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:58:15,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:58:15,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:58:15,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:58:15,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:58:15,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:58:15,191 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:58:15,192 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:58:15,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:58:15,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:58:15,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:58:15,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:58:15,194 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 -> 7ec09e5648980bc5a4329f49d7e2504b195b194638f2d82967f3c7db0031611d [2024-11-12 06:58:15,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:58:15,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:58:15,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:58:15,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:58:15,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:58:15,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i [2024-11-12 06:58:17,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:58:17,289 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:58:17,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i [2024-11-12 06:58:17,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf176d0cb/14a828618a36450382a5f2568d779030/FLAG8f1884c15 [2024-11-12 06:58:17,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf176d0cb/14a828618a36450382a5f2568d779030 [2024-11-12 06:58:17,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:58:17,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:58:17,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:58:17,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:58:17,332 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:58:17,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:58:17" (1/1) ... [2024-11-12 06:58:17,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b58587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:17, skipping insertion in model container [2024-11-12 06:58:17,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:58:17" (1/1) ... [2024-11-12 06:58:17,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:58:17,562 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_variablewrapping_normal_file-35.i[913,926] [2024-11-12 06:58:17,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:58:17,635 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:58:17,647 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_variablewrapping_normal_file-35.i[913,926] [2024-11-12 06:58:17,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:58:17,695 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:58:17,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:17 WrapperNode [2024-11-12 06:58:17,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:58:17,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:58:17,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:58:17,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:58:17,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:17" (1/1) ... [2024-11-12 06:58:17,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:17" (1/1) ... [2024-11-12 06:58:17,749 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-12 06:58:17,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:58:17,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:58:17,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:58:17,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:58:17,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:17" (1/1) ... [2024-11-12 06:58:17,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:17" (1/1) ... [2024-11-12 06:58:17,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:17" (1/1) ... [2024-11-12 06:58:17,790 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:58:17,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:17" (1/1) ... [2024-11-12 06:58:17,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:17" (1/1) ... [2024-11-12 06:58:17,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:17" (1/1) ... [2024-11-12 06:58:17,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:17" (1/1) ... [2024-11-12 06:58:17,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:17" (1/1) ... [2024-11-12 06:58:17,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:17" (1/1) ... [2024-11-12 06:58:17,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:58:17,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:58:17,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:58:17,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:58:17,832 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:17" (1/1) ... [2024-11-12 06:58:17,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:58:17,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:58:17,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:58:17,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:58:17,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:58:17,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:58:17,919 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:58:17,919 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:58:17,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:58:17,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:58:18,005 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:58:18,008 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:58:18,879 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 06:58:18,881 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:58:18,893 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:58:18,893 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:58:18,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:58:18 BoogieIcfgContainer [2024-11-12 06:58:18,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:58:18,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:58:18,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:58:18,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:58:18,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:58:17" (1/3) ... [2024-11-12 06:58:18,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788552ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:58:18, skipping insertion in model container [2024-11-12 06:58:18,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:58:17" (2/3) ... [2024-11-12 06:58:18,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788552ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:58:18, skipping insertion in model container [2024-11-12 06:58:18,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:58:18" (3/3) ... [2024-11-12 06:58:18,904 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-35.i [2024-11-12 06:58:18,921 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:58:18,922 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:58:18,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:58:18,993 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;@72a7f805, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:58:18,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:58:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:58:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 06:58:19,012 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:19,013 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:19,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:19,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:19,021 INFO L85 PathProgramCache]: Analyzing trace with hash -232387294, now seen corresponding path program 1 times [2024-11-12 06:58:19,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:58:19,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204162764] [2024-11-12 06:58:19,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:19,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:58:19,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:58:19,041 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:58:19,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 06:58:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:19,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:58:19,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:58:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-12 06:58:19,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:58:19,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:58:19,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204162764] [2024-11-12 06:58:19,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204162764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:19,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:19,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:58:19,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815301856] [2024-11-12 06:58:19,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:19,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:58:19,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:58:19,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:58:19,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:58:19,482 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 06:58:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:19,516 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2024-11-12 06:58:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:58:19,519 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-11-12 06:58:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:19,526 INFO L225 Difference]: With dead ends: 101 [2024-11-12 06:58:19,526 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 06:58:19,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:58:19,535 INFO L435 NwaCegarLoop]: 73 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, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:19,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:58:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 06:58:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-12 06:58:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:58:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-12 06:58:19,585 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 115 [2024-11-12 06:58:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:19,586 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-12 06:58:19,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 06:58:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-12 06:58:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 06:58:19,589 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:19,590 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:19,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 06:58:19,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:58:19,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:19,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:19,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1342920990, now seen corresponding path program 1 times [2024-11-12 06:58:19,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:58:19,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059384684] [2024-11-12 06:58:19,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:19,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-12 06:58:19,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:58:19,796 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:58:19,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 06:58:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:20,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 06:58:20,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:58:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 06:58:20,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:58:20,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:58:20,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059384684] [2024-11-12 06:58:20,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059384684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:58:20,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:58:20,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:58:20,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79182629] [2024-11-12 06:58:20,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:58:20,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:58:20,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:58:20,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:58:20,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:58:20,181 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:20,850 INFO L93 Difference]: Finished difference Result 97 states and 143 transitions. [2024-11-12 06:58:20,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:58:20,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-12 06:58:20,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:20,865 INFO L225 Difference]: With dead ends: 97 [2024-11-12 06:58:20,865 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 06:58:20,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 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-12 06:58:20,868 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:20,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 06:58:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 06:58:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-12 06:58:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:58:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2024-11-12 06:58:20,879 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 115 [2024-11-12 06:58:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:20,881 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2024-11-12 06:58:20,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 06:58:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2024-11-12 06:58:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 06:58:20,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:20,887 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:20,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 06:58:21,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:58:21,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:21,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:21,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1735948000, now seen corresponding path program 1 times [2024-11-12 06:58:21,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:58:21,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170954413] [2024-11-12 06:58:21,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:21,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:58:21,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:58:21,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:58:21,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 06:58:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:21,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 06:58:21,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:58:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 303 proven. 18 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 06:58:21,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:58:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-12 06:58:21,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:58:21,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170954413] [2024-11-12 06:58:21,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170954413] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 06:58:21,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 06:58:21,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-12 06:58:21,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63271581] [2024-11-12 06:58:21,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 06:58:21,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 06:58:21,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:58:21,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 06:58:21,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 06:58:21,920 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 06:58:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:58:23,355 INFO L93 Difference]: Finished difference Result 213 states and 296 transitions. [2024-11-12 06:58:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 06:58:23,355 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 115 [2024-11-12 06:58:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:58:23,358 INFO L225 Difference]: With dead ends: 213 [2024-11-12 06:58:23,359 INFO L226 Difference]: Without dead ends: 166 [2024-11-12 06:58:23,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2024-11-12 06:58:23,361 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 123 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:58:23,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 222 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 06:58:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-12 06:58:23,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 56. [2024-11-12 06:58:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:58:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2024-11-12 06:58:23,387 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 115 [2024-11-12 06:58:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:58:23,388 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-11-12 06:58:23,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 06:58:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-11-12 06:58:23,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 06:58:23,390 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:58:23,390 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:58:23,402 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-12 06:58:23,591 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-12 06:58:23,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:58:23,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:58:23,592 INFO L85 PathProgramCache]: Analyzing trace with hash -726753632, now seen corresponding path program 1 times [2024-11-12 06:58:23,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:58:23,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871640362] [2024-11-12 06:58:23,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:58:23,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:58:23,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:58:23,595 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-12 06:58:23,596 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-12 06:58:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:58:23,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 06:58:23,894 INFO L279 TraceCheckSpWp]: Computing forward predicates...