./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e14c549015d0f5635e62f75071e62e4bb462bdcfc99319d92dbe4063b5fd473b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:08:32,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:08:32,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:08:32,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:08:32,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:08:32,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:08:32,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:08:32,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:08:32,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:08:32,232 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:08:32,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:08:32,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:08:32,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:08:32,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:08:32,237 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:08:32,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:08:32,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:08:32,238 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:08:32,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:08:32,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:08:32,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:08:32,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:08:32,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:08:32,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:08:32,242 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:08:32,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:08:32,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:08:32,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:08:32,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:08:32,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:08:32,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:08:32,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:08:32,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:08:32,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:08:32,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:08:32,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:08:32,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:08:32,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:08:32,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:08:32,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:08:32,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:08:32,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:08:32,248 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e14c549015d0f5635e62f75071e62e4bb462bdcfc99319d92dbe4063b5fd473b [2024-10-11 13:08:32,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:08:32,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:08:32,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:08:32,503 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:08:32,504 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:08:32,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i [2024-10-11 13:08:33,983 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:08:34,163 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:08:34,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i [2024-10-11 13:08:34,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/57e065c87/bdffbaeb25974cf99450137f030af7ed/FLAGec30d08a9 [2024-10-11 13:08:34,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/57e065c87/bdffbaeb25974cf99450137f030af7ed [2024-10-11 13:08:34,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:08:34,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:08:34,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:08:34,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:08:34,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:08:34,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:08:34" (1/1) ... [2024-10-11 13:08:34,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311a5725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:34, skipping insertion in model container [2024-10-11 13:08:34,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:08:34" (1/1) ... [2024-10-11 13:08:34,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:08:34,764 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i[913,926] [2024-10-11 13:08:34,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:08:34,824 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:08:34,834 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i[913,926] [2024-10-11 13:08:34,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:08:34,870 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:08:34,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:34 WrapperNode [2024-10-11 13:08:34,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:08:34,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:08:34,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:08:34,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:08:34,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:34" (1/1) ... [2024-10-11 13:08:34,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:34" (1/1) ... [2024-10-11 13:08:34,919 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-10-11 13:08:34,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:08:34,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:08:34,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:08:34,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:08:34,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:34" (1/1) ... [2024-10-11 13:08:34,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:34" (1/1) ... [2024-10-11 13:08:34,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:34" (1/1) ... [2024-10-11 13:08:34,948 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 13:08:34,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:34" (1/1) ... [2024-10-11 13:08:34,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:34" (1/1) ... [2024-10-11 13:08:34,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:34" (1/1) ... [2024-10-11 13:08:34,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:34" (1/1) ... [2024-10-11 13:08:34,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:34" (1/1) ... [2024-10-11 13:08:34,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:34" (1/1) ... [2024-10-11 13:08:34,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:08:34,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:08:34,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:08:34,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:08:34,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:34" (1/1) ... [2024-10-11 13:08:34,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:08:34,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:08:35,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:08:35,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:08:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:08:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:08:35,078 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:08:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:08:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:08:35,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:08:35,171 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:08:35,173 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:08:35,420 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 13:08:35,420 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:08:35,483 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:08:35,483 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:08:35,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:08:35 BoogieIcfgContainer [2024-10-11 13:08:35,484 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:08:35,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:08:35,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:08:35,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:08:35,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:08:34" (1/3) ... [2024-10-11 13:08:35,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f602734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:08:35, skipping insertion in model container [2024-10-11 13:08:35,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:34" (2/3) ... [2024-10-11 13:08:35,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f602734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:08:35, skipping insertion in model container [2024-10-11 13:08:35,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:08:35" (3/3) ... [2024-10-11 13:08:35,495 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-63.i [2024-10-11 13:08:35,511 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:08:35,512 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:08:35,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:08:35,587 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;@5e963933, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:08:35,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:08:35,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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-10-11 13:08:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 13:08:35,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:35,606 INFO L215 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] [2024-10-11 13:08:35,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:35,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:35,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1128104834, now seen corresponding path program 1 times [2024-10-11 13:08:35,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:08:35,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880414925] [2024-10-11 13:08:35,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:35,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:08:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:35,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:08:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:35,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:08:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:35,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:08:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:35,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:08:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:35,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 13:08:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:35,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 13:08:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:35,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 13:08:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:35,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 13:08:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:35,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 13:08:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:08:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:08:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 13:08:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 13:08:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 13:08:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 13:08:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:08:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:08:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 13:08:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:08:36,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:08:36,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880414925] [2024-10-11 13:08:36,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880414925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:08:36,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:08:36,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:08:36,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679586481] [2024-10-11 13:08:36,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:08:36,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:08:36,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:08:36,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:08:36,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:08:36,122 INFO L87 Difference]: Start difference. First operand has 46 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-10-11 13:08:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:08:36,164 INFO L93 Difference]: Finished difference Result 89 states and 154 transitions. [2024-10-11 13:08:36,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:08:36,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 110 [2024-10-11 13:08:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:08:36,173 INFO L225 Difference]: With dead ends: 89 [2024-10-11 13:08:36,173 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 13:08:36,176 INFO L431 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-10-11 13:08:36,180 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:08:36,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:08:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 13:08:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 13:08:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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-10-11 13:08:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2024-10-11 13:08:36,220 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 110 [2024-10-11 13:08:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:08:36,221 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2024-10-11 13:08:36,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-10-11 13:08:36,222 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2024-10-11 13:08:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 13:08:36,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:36,225 INFO L215 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] [2024-10-11 13:08:36,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:08:36,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:36,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:36,226 INFO L85 PathProgramCache]: Analyzing trace with hash -314708994, now seen corresponding path program 1 times [2024-10-11 13:08:36,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:08:36,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523731495] [2024-10-11 13:08:36,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:36,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:08:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:08:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:08:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:08:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:08:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 13:08:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 13:08:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 13:08:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 13:08:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 13:08:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:08:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:08:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 13:08:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 13:08:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 13:08:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 13:08:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:08:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:08:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 13:08:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 13:08:36,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:08:36,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523731495] [2024-10-11 13:08:36,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523731495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:08:36,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:08:36,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:08:36,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418874169] [2024-10-11 13:08:36,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:08:36,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:08:36,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:08:36,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:08:36,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:08:36,895 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:08:37,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:08:37,212 INFO L93 Difference]: Finished difference Result 91 states and 130 transitions. [2024-10-11 13:08:37,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:08:37,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 110 [2024-10-11 13:08:37,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:08:37,218 INFO L225 Difference]: With dead ends: 91 [2024-10-11 13:08:37,218 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 13:08:37,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:08:37,220 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 83 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:08:37,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 86 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:08:37,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 13:08:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 13:08:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 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-10-11 13:08:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2024-10-11 13:08:37,245 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 110 [2024-10-11 13:08:37,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:08:37,246 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2024-10-11 13:08:37,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:08:37,247 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2024-10-11 13:08:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 13:08:37,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:37,252 INFO L215 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] [2024-10-11 13:08:37,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:08:37,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:37,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:37,252 INFO L85 PathProgramCache]: Analyzing trace with hash -312861952, now seen corresponding path program 1 times [2024-10-11 13:08:37,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:08:37,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100626553] [2024-10-11 13:08:37,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:37,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:08:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:08:37,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:08:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:08:37,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:08:37,485 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:08:37,486 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:08:37,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:08:37,491 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 13:08:37,579 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:08:37,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:08:37 BoogieIcfgContainer [2024-10-11 13:08:37,585 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:08:37,585 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:08:37,586 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:08:37,589 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:08:37,590 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:08:35" (3/4) ... [2024-10-11 13:08:37,592 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:08:37,593 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:08:37,596 INFO L158 Benchmark]: Toolchain (without parser) took 3042.17ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 95.6MB in the beginning and 117.9MB in the end (delta: -22.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 13:08:37,596 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:08:37,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.25ms. Allocated memory is still 151.0MB. Free memory was 95.3MB in the beginning and 80.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:08:37,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.98ms. Allocated memory is still 151.0MB. Free memory was 80.3MB in the beginning and 78.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:08:37,598 INFO L158 Benchmark]: Boogie Preprocessor took 40.70ms. Allocated memory is still 151.0MB. Free memory was 78.2MB in the beginning and 75.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:08:37,599 INFO L158 Benchmark]: RCFGBuilder took 522.58ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 75.5MB in the beginning and 160.5MB in the end (delta: -85.0MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-10-11 13:08:37,599 INFO L158 Benchmark]: TraceAbstraction took 2098.17ms. Allocated memory is still 203.4MB. Free memory was 160.5MB in the beginning and 119.0MB in the end (delta: 41.5MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2024-10-11 13:08:37,601 INFO L158 Benchmark]: Witness Printer took 8.12ms. Allocated memory is still 203.4MB. Free memory was 119.0MB in the beginning and 117.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:08:37,603 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.18ms. Allocated memory is still 151.0MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.25ms. Allocated memory is still 151.0MB. Free memory was 95.3MB in the beginning and 80.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.98ms. Allocated memory is still 151.0MB. Free memory was 80.3MB in the beginning and 78.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.70ms. Allocated memory is still 151.0MB. Free memory was 78.2MB in the beginning and 75.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.58ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 75.5MB in the beginning and 160.5MB in the end (delta: -85.0MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2098.17ms. Allocated memory is still 203.4MB. Free memory was 160.5MB in the beginning and 119.0MB in the end (delta: 41.5MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * Witness Printer took 8.12ms. Allocated memory is still 203.4MB. Free memory was 119.0MB in the beginning and 117.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 8.3; [L24] float var_1_3 = 2.25; [L25] float var_1_4 = 10.3; [L26] unsigned char var_1_6 = 0; [L27] signed long int var_1_7 = 128; [L28] float var_1_8 = 9.8; [L29] unsigned long int var_1_13 = 1; [L30] unsigned long int var_1_14 = 32; [L31] signed char var_1_15 = -10; [L32] signed char var_1_16 = 16; [L33] signed char var_1_17 = 25; [L34] signed char var_1_18 = 1; [L35] signed char var_1_19 = 0; [L36] signed char var_1_20 = 32; [L37] signed short int var_1_21 = 256; [L38] signed char var_1_22 = 16; [L39] unsigned char var_1_23 = 0; [L40] signed short int last_1_var_1_21 = 256; [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L93] last_1_var_1_21 = var_1_21 [L103] RET updateLastVariables() [L104] CALL updateVariables() [L62] var_1_2 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L63] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L64] var_1_3 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L65] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L66] var_1_4 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128, var_1_8=49/5] [L67] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128, var_1_8=49/5] [L68] var_1_6 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_7=128, var_1_8=49/5] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_7=128, var_1_8=49/5] [L70] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128, var_1_8=49/5] [L70] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128, var_1_8=49/5] [L71] var_1_8 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L72] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L73] var_1_14 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L74] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L75] CALL assume_abort_if_not(var_1_14 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L75] RET assume_abort_if_not(var_1_14 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L76] var_1_16 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L77] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L78] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L78] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L79] var_1_17 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_17 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L80] RET assume_abort_if_not(var_1_17 >= -1) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L81] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L81] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L82] var_1_18 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L83] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L84] CALL assume_abort_if_not(var_1_18 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L84] RET assume_abort_if_not(var_1_18 <= 31) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L85] var_1_19 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L86] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L87] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L87] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L88] var_1_20 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L89] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L90] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L90] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L104] RET updateVariables() [L105] CALL step() [L44] var_1_13 = var_1_14 [L45] var_1_21 = last_1_var_1_21 [L46] var_1_22 = var_1_16 [L47] var_1_23 = var_1_6 VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=21, var_1_23=-256, var_1_6=-256, var_1_7=128] [L48] COND TRUE ((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4) [L49] var_1_1 = (var_1_23 && var_1_6) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=21, var_1_23=-256, var_1_6=-256, var_1_7=128] [L51] signed char stepLocal_0 = var_1_22; VAL [isInitial=1, last_1_var_1_21=256, stepLocal_0=21, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=21, var_1_23=-256, var_1_6=-256, var_1_7=128] [L52] COND FALSE !(stepLocal_0 != ((((var_1_22) < (var_1_21)) ? (var_1_22) : (var_1_21)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=21, var_1_23=-256, var_1_6=-256, var_1_7=128] [L55] COND TRUE var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8) [L56] var_1_7 = (((((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) > (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=21, var_1_23=-256, var_1_6=-256, var_1_7=11] [L105] RET step() [L106] CALL, EXPR property() [L96-L97] return (((((((((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4)) ? (var_1_1 == ((unsigned char) (var_1_23 && var_1_6))) : 1) && ((var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8)) ? (var_1_7 == ((signed long int) (((((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) > (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))))) : (var_1_7 == ((signed long int) var_1_22)))) && (var_1_13 == ((unsigned long int) var_1_14))) && ((var_1_22 != ((((var_1_22) < (var_1_21)) ? (var_1_22) : (var_1_21)))) ? (var_1_15 == ((signed char) ((((((10 + var_1_16)) < (var_1_17)) ? ((10 + var_1_16)) : (var_1_17))) - ((32 - var_1_18) + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))))))) : 1)) && (var_1_21 == ((signed short int) last_1_var_1_21))) && (var_1_22 == ((signed char) var_1_16))) && (var_1_23 == ((unsigned char) var_1_6)) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=21, var_1_23=-256, var_1_6=-256, var_1_7=11] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=21, var_1_17=-1, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=21, var_1_23=-256, var_1_6=-256, var_1_7=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 117 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1224/1224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:08:37,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e14c549015d0f5635e62f75071e62e4bb462bdcfc99319d92dbe4063b5fd473b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:08:39,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:08:39,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:08:39,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:08:39,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:08:39,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:08:39,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:08:39,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:08:39,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:08:39,916 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:08:39,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:08:39,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:08:39,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:08:39,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:08:39,919 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:08:39,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:08:39,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:08:39,920 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:08:39,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:08:39,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:08:39,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:08:39,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:08:39,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:08:39,925 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:08:39,925 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:08:39,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:08:39,926 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:08:39,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:08:39,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:08:39,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:08:39,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:08:39,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:08:39,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:08:39,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:08:39,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:08:39,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:08:39,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:08:39,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:08:39,930 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:08:39,930 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:08:39,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:08:39,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:08:39,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:08:39,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:08:39,931 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:08:39,932 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e14c549015d0f5635e62f75071e62e4bb462bdcfc99319d92dbe4063b5fd473b [2024-10-11 13:08:40,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:08:40,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:08:40,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:08:40,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:08:40,308 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:08:40,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i [2024-10-11 13:08:41,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:08:42,166 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:08:42,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i [2024-10-11 13:08:42,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8bb6a2d73/83058836d14642779808941dd8954524/FLAGdc1499dda [2024-10-11 13:08:42,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8bb6a2d73/83058836d14642779808941dd8954524 [2024-10-11 13:08:42,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:08:42,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:08:42,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:08:42,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:08:42,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:08:42,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:08:42" (1/1) ... [2024-10-11 13:08:42,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47cb98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:42, skipping insertion in model container [2024-10-11 13:08:42,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:08:42" (1/1) ... [2024-10-11 13:08:42,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:08:42,450 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i[913,926] [2024-10-11 13:08:42,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:08:42,533 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:08:42,544 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-63.i[913,926] [2024-10-11 13:08:42,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:08:42,597 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:08:42,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:42 WrapperNode [2024-10-11 13:08:42,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:08:42,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:08:42,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:08:42,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:08:42,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:42" (1/1) ... [2024-10-11 13:08:42,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:42" (1/1) ... [2024-10-11 13:08:42,650 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-10-11 13:08:42,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:08:42,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:08:42,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:08:42,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:08:42,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:42" (1/1) ... [2024-10-11 13:08:42,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:42" (1/1) ... [2024-10-11 13:08:42,678 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:42" (1/1) ... [2024-10-11 13:08:42,699 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 13:08:42,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:42" (1/1) ... [2024-10-11 13:08:42,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:42" (1/1) ... [2024-10-11 13:08:42,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:42" (1/1) ... [2024-10-11 13:08:42,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:42" (1/1) ... [2024-10-11 13:08:42,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:42" (1/1) ... [2024-10-11 13:08:42,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:42" (1/1) ... [2024-10-11 13:08:42,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:08:42,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:08:42,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:08:42,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:08:42,743 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:42" (1/1) ... [2024-10-11 13:08:42,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:08:42,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:08:42,782 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:08:42,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:08:42,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:08:42,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:08:42,828 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:08:42,828 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:08:42,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:08:42,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:08:42,907 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:08:42,909 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:08:44,444 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 13:08:44,444 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:08:44,519 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:08:44,519 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:08:44,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:08:44 BoogieIcfgContainer [2024-10-11 13:08:44,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:08:44,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:08:44,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:08:44,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:08:44,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:08:42" (1/3) ... [2024-10-11 13:08:44,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca1b9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:08:44, skipping insertion in model container [2024-10-11 13:08:44,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:42" (2/3) ... [2024-10-11 13:08:44,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca1b9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:08:44, skipping insertion in model container [2024-10-11 13:08:44,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:08:44" (3/3) ... [2024-10-11 13:08:44,533 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-63.i [2024-10-11 13:08:44,549 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:08:44,549 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:08:44,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:08:44,627 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;@5b13146, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:08:44,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:08:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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-10-11 13:08:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 13:08:44,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:44,644 INFO L215 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] [2024-10-11 13:08:44,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:44,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:44,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1128104834, now seen corresponding path program 1 times [2024-10-11 13:08:44,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:08:44,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084924903] [2024-10-11 13:08:44,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:44,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:08:44,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:08:44,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:08:44,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:08:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:08:44,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:08:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-10-11 13:08:45,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:08:45,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:08:45,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084924903] [2024-10-11 13:08:45,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084924903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:08:45,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:08:45,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:08:45,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177372696] [2024-10-11 13:08:45,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:08:45,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:08:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:08:45,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:08:45,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:08:45,087 INFO L87 Difference]: Start difference. First operand has 46 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-10-11 13:08:47,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:08:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:08:47,490 INFO L93 Difference]: Finished difference Result 89 states and 154 transitions. [2024-10-11 13:08:47,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:08:47,506 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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 110 [2024-10-11 13:08:47,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:08:47,512 INFO L225 Difference]: With dead ends: 89 [2024-10-11 13:08:47,513 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 13:08:47,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:08:47,518 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:08:47,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 13:08:47,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 13:08:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 13:08:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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-10-11 13:08:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2024-10-11 13:08:47,554 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 110 [2024-10-11 13:08:47,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:08:47,554 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2024-10-11 13:08:47,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-10-11 13:08:47,555 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2024-10-11 13:08:47,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 13:08:47,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:47,558 INFO L215 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] [2024-10-11 13:08:47,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:08:47,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:08:47,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:47,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:47,760 INFO L85 PathProgramCache]: Analyzing trace with hash -314708994, now seen corresponding path program 1 times [2024-10-11 13:08:47,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:08:47,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926494375] [2024-10-11 13:08:47,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:47,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:08:47,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:08:47,765 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:08:47,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:08:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:48,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:08:48,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:08:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:08:48,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:08:49,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:08:49,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926494375] [2024-10-11 13:08:49,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926494375] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:08:49,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [433569589] [2024-10-11 13:08:49,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:49,478 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:08:49,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:08:49,481 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:08:49,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 13:08:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:50,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:08:50,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:08:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:08:50,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:08:51,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [433569589] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:08:51,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:08:51,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-11 13:08:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010467141] [2024-10-11 13:08:51,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:08:51,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:08:51,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:08:51,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:08:51,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:08:51,090 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:08:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:08:53,248 INFO L93 Difference]: Finished difference Result 93 states and 132 transitions. [2024-10-11 13:08:53,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:08:53,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 110 [2024-10-11 13:08:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:08:53,267 INFO L225 Difference]: With dead ends: 93 [2024-10-11 13:08:53,267 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 13:08:53,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:08:53,270 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 44 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:08:53,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 89 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 13:08:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 13:08:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-10-11 13:08:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 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-10-11 13:08:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2024-10-11 13:08:53,297 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 110 [2024-10-11 13:08:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:08:53,298 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2024-10-11 13:08:53,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 13:08:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2024-10-11 13:08:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 13:08:53,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:53,303 INFO L215 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] [2024-10-11 13:08:53,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 13:08:53,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-11 13:08:53,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:08:53,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:53,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash -312861952, now seen corresponding path program 1 times [2024-10-11 13:08:53,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:08:53,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497850551] [2024-10-11 13:08:53,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:53,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:08:53,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:08:53,710 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:08:53,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 13:08:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:53,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:08:53,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:09:38,542 WARN L286 SmtUtils]: Spent 12.44s on a formula simplification. DAG size of input: 58 DAG size of output: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)