./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-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 705f1434cf57fe07ebfc06c0b1211b5e86887658700ddfe642f1846035ec4c01 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:05:05,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:05:05,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:05:05,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:05:05,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:05:05,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:05:05,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:05:05,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:05:05,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:05:05,902 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:05:05,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:05:05,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:05:05,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:05:05,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:05:05,905 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:05:05,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:05:05,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:05:05,906 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:05:05,906 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:05:05,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:05:05,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:05:05,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:05:05,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:05:05,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:05:05,910 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:05:05,910 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:05:05,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:05:05,910 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:05:05,910 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:05:05,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:05:05,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:05:05,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:05:05,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:05:05,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:05:05,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:05:05,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:05:05,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:05:05,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:05:05,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:05:05,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:05:05,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:05:05,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:05:05,914 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 705f1434cf57fe07ebfc06c0b1211b5e86887658700ddfe642f1846035ec4c01 [2024-10-24 11:05:06,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:05:06,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:05:06,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:05:06,192 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:05:06,192 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:05:06,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i [2024-10-24 11:05:07,613 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:05:07,856 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:05:07,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i [2024-10-24 11:05:07,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30e7e602a/03aae95c2de74ec8bdd1c11f83e738ad/FLAG71b8090c3 [2024-10-24 11:05:08,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30e7e602a/03aae95c2de74ec8bdd1c11f83e738ad [2024-10-24 11:05:08,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:05:08,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:05:08,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:05:08,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:05:08,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:05:08,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:05:08" (1/1) ... [2024-10-24 11:05:08,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413a3efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:08, skipping insertion in model container [2024-10-24 11:05:08,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:05:08" (1/1) ... [2024-10-24 11:05:08,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:05:08,429 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-37.i[913,926] [2024-10-24 11:05:08,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:05:08,508 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:05:08,521 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-37.i[913,926] [2024-10-24 11:05:08,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:05:08,565 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:05:08,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:08 WrapperNode [2024-10-24 11:05:08,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:05:08,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:05:08,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:05:08,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:05:08,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:08" (1/1) ... [2024-10-24 11:05:08,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:08" (1/1) ... [2024-10-24 11:05:08,637 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-10-24 11:05:08,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:05:08,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:05:08,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:05:08,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:05:08,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:08" (1/1) ... [2024-10-24 11:05:08,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:08" (1/1) ... [2024-10-24 11:05:08,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:08" (1/1) ... [2024-10-24 11:05:08,680 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-24 11:05:08,681 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:08" (1/1) ... [2024-10-24 11:05:08,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:08" (1/1) ... [2024-10-24 11:05:08,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:08" (1/1) ... [2024-10-24 11:05:08,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:08" (1/1) ... [2024-10-24 11:05:08,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:08" (1/1) ... [2024-10-24 11:05:08,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:08" (1/1) ... [2024-10-24 11:05:08,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:05:08,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:05:08,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:05:08,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:05:08,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:08" (1/1) ... [2024-10-24 11:05:08,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:05:08,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:05:08,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:05:08,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:05:08,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:05:08,797 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:05:08,797 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:05:08,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:05:08,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:05:08,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:05:08,892 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:05:08,896 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:05:09,198 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 11:05:09,199 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:05:09,249 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:05:09,249 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:05:09,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:05:09 BoogieIcfgContainer [2024-10-24 11:05:09,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:05:09,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:05:09,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:05:09,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:05:09,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:05:08" (1/3) ... [2024-10-24 11:05:09,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79993462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:05:09, skipping insertion in model container [2024-10-24 11:05:09,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:08" (2/3) ... [2024-10-24 11:05:09,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79993462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:05:09, skipping insertion in model container [2024-10-24 11:05:09,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:05:09" (3/3) ... [2024-10-24 11:05:09,261 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-37.i [2024-10-24 11:05:09,278 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:05:09,279 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:05:09,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:05:09,345 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;@77bdf83f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:05:09,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:05:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:05:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:05:09,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:05:09,363 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:05:09,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:05:09,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:05:09,370 INFO L85 PathProgramCache]: Analyzing trace with hash -303530146, now seen corresponding path program 1 times [2024-10-24 11:05:09,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:05:09,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644120835] [2024-10-24 11:05:09,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:09,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:05:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:05:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:05:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:05:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:05:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:05:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:05:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:05:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:05:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:05:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:05:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:05:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:05:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:05:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:05:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:05:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:09,785 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:05:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:05:09,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644120835] [2024-10-24 11:05:09,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644120835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:05:09,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:05:09,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:05:09,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663980613] [2024-10-24 11:05:09,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:05:09,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:05:09,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:05:09,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:05:09,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:05:09,831 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:05:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:05:09,874 INFO L93 Difference]: Finished difference Result 99 states and 169 transitions. [2024-10-24 11:05:09,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:05:09,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2024-10-24 11:05:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:05:09,890 INFO L225 Difference]: With dead ends: 99 [2024-10-24 11:05:09,891 INFO L226 Difference]: Without dead ends: 49 [2024-10-24 11:05:09,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-24 11:05:09,899 INFO L432 NwaCegarLoop]: 70 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, 70 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-24 11:05:09,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:05:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-24 11:05:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-24 11:05:09,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:05:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2024-10-24 11:05:09,948 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 96 [2024-10-24 11:05:09,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:05:09,949 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2024-10-24 11:05:09,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:05:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2024-10-24 11:05:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:05:09,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:05:09,955 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:05:09,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:05:09,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:05:09,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:05:09,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1841069788, now seen corresponding path program 1 times [2024-10-24 11:05:09,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:05:09,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861306016] [2024-10-24 11:05:09,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:09,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:05:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:05:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:05:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:05:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:05:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:05:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:05:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:05:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:05:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:05:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:05:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 11:05:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:05:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:05:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:05:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 11:05:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 11:05:10,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:05:10,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861306016] [2024-10-24 11:05:10,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861306016] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:05:10,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198198960] [2024-10-24 11:05:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:10,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:05:10,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:05:10,995 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:05:10,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:05:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:11,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 11:05:11,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:05:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 213 proven. 78 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-10-24 11:05:11,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:05:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 87 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-10-24 11:05:12,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198198960] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:05:12,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:05:12,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 24 [2024-10-24 11:05:12,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723187886] [2024-10-24 11:05:12,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:05:12,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 11:05:12,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:05:12,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 11:05:12,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:05:12,348 INFO L87 Difference]: Start difference. First operand 49 states and 73 transitions. Second operand has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 8 states have call successors, (43), 4 states have call predecessors, (43), 9 states have return successors, (44), 7 states have call predecessors, (44), 8 states have call successors, (44) [2024-10-24 11:05:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:05:12,914 INFO L93 Difference]: Finished difference Result 117 states and 161 transitions. [2024-10-24 11:05:12,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 11:05:12,915 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 8 states have call successors, (43), 4 states have call predecessors, (43), 9 states have return successors, (44), 7 states have call predecessors, (44), 8 states have call successors, (44) Word has length 96 [2024-10-24 11:05:12,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:05:12,916 INFO L225 Difference]: With dead ends: 117 [2024-10-24 11:05:12,917 INFO L226 Difference]: Without dead ends: 69 [2024-10-24 11:05:12,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=403, Invalid=929, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 11:05:12,919 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 225 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:05:12,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 125 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:05:12,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-24 11:05:12,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2024-10-24 11:05:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:05:12,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2024-10-24 11:05:12,940 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 96 [2024-10-24 11:05:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:05:12,942 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2024-10-24 11:05:12,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 8 states have call successors, (43), 4 states have call predecessors, (43), 9 states have return successors, (44), 7 states have call predecessors, (44), 8 states have call successors, (44) [2024-10-24 11:05:12,943 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2024-10-24 11:05:12,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:05:12,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:05:12,948 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:05:12,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:05:13,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:05:13,153 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:05:13,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:05:13,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1752832930, now seen corresponding path program 1 times [2024-10-24 11:05:13,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:05:13,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457841105] [2024-10-24 11:05:13,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:13,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:05:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:05:13,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [682380466] [2024-10-24 11:05:13,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:13,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:05:13,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:05:13,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:05:13,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:05:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:13,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 11:05:13,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:05:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 228 proven. 42 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-24 11:05:38,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:05:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:05:39,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:05:39,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457841105] [2024-10-24 11:05:39,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:05:39,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682380466] [2024-10-24 11:05:39,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682380466] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:05:39,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:05:39,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2024-10-24 11:05:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492975428] [2024-10-24 11:05:39,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:05:39,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:05:39,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:05:39,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:05:39,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=121, Unknown=4, NotChecked=0, Total=156 [2024-10-24 11:05:39,244 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:05:43,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:05:43,355 INFO L93 Difference]: Finished difference Result 174 states and 223 transitions. [2024-10-24 11:05:43,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:05:43,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2024-10-24 11:05:43,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:05:43,357 INFO L225 Difference]: With dead ends: 174 [2024-10-24 11:05:43,357 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 11:05:43,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=35, Invalid=142, Unknown=5, NotChecked=0, Total=182 [2024-10-24 11:05:43,359 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 69 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:05:43,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 231 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:05:43,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 11:05:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 66. [2024-10-24 11:05:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:05:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2024-10-24 11:05:43,382 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 96 [2024-10-24 11:05:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:05:43,385 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-10-24 11:05:43,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:05:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2024-10-24 11:05:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:05:43,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:05:43,390 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:05:43,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:05:43,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-24 11:05:43,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:05:43,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:05:43,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1732787740, now seen corresponding path program 1 times [2024-10-24 11:05:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:05:43,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602765968] [2024-10-24 11:05:43,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:43,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:05:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:05:43,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1724115106] [2024-10-24 11:05:43,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:43,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:05:43,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:05:43,653 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:05:43,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 11:05:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:05:43,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:05:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:05:43,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:05:43,941 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:05:43,942 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:05:43,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 11:05:44,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:05:44,147 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 11:05:44,225 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:05:44,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:05:44 BoogieIcfgContainer [2024-10-24 11:05:44,228 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:05:44,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:05:44,233 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:05:44,233 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:05:44,233 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:05:09" (3/4) ... [2024-10-24 11:05:44,235 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:05:44,236 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:05:44,237 INFO L158 Benchmark]: Toolchain (without parser) took 36015.12ms. Allocated memory was 169.9MB in the beginning and 213.9MB in the end (delta: 44.0MB). Free memory was 135.5MB in the beginning and 163.7MB in the end (delta: -28.2MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-10-24 11:05:44,239 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:05:44,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.53ms. Allocated memory is still 169.9MB. Free memory was 135.5MB in the beginning and 120.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 11:05:44,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.22ms. Allocated memory is still 169.9MB. Free memory was 120.4MB in the beginning and 117.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:05:44,240 INFO L158 Benchmark]: Boogie Preprocessor took 54.35ms. Allocated memory is still 169.9MB. Free memory was 117.0MB in the beginning and 114.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:05:44,240 INFO L158 Benchmark]: RCFGBuilder took 552.49ms. Allocated memory is still 169.9MB. Free memory was 114.1MB in the beginning and 92.6MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 11:05:44,240 INFO L158 Benchmark]: TraceAbstraction took 34975.93ms. Allocated memory was 169.9MB in the beginning and 213.9MB in the end (delta: 44.0MB). Free memory was 91.8MB in the beginning and 164.7MB in the end (delta: -72.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:05:44,241 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 213.9MB. Free memory was 164.7MB in the beginning and 163.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:05:44,242 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.14ms. Allocated memory is still 109.1MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.53ms. Allocated memory is still 169.9MB. Free memory was 135.5MB in the beginning and 120.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.22ms. Allocated memory is still 169.9MB. Free memory was 120.4MB in the beginning and 117.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.35ms. Allocated memory is still 169.9MB. Free memory was 117.0MB in the beginning and 114.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 552.49ms. Allocated memory is still 169.9MB. Free memory was 114.1MB in the beginning and 92.6MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 34975.93ms. Allocated memory was 169.9MB in the beginning and 213.9MB in the end (delta: 44.0MB). Free memory was 91.8MB in the beginning and 164.7MB in the end (delta: -72.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 213.9MB. Free memory was 164.7MB in the beginning and 163.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 90, overapproximation of bitwiseOr at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L23] unsigned short int var_1_2 = 59049; [L24] unsigned short int var_1_3 = 100; [L25] unsigned char var_1_6 = 16; [L26] signed char var_1_7 = -25; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 25; [L29] signed char var_1_10 = -10; [L30] signed char var_1_11 = 0; [L31] float var_1_12 = 25.1; [L32] unsigned long int var_1_13 = 2531521428; [L33] signed long int var_1_14 = -128; [L34] signed long int var_1_15 = 256; [L35] signed short int var_1_16 = -16; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L64] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L65] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L66] var_1_3 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L67] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L68] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L68] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_7=-25, var_1_8=16, var_1_9=25] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_7=-25, var_1_8=16, var_1_9=25] [L71] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=16, var_1_9=25] [L71] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=16, var_1_9=25] [L72] var_1_8 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L73] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L74] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L74] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=25] [L75] var_1_9 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_9 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 31) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L78] var_1_10 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L79] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L80] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_12=251/10, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L81] var_1_12 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L82] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L83] var_1_13 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=-2147483649, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=-2147483649, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L84] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=-2147483649, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=-2147483649, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=6, var_1_11=0, var_1_13=-2147483649, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L85] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=-2147483649, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L98] RET updateVariables() [L99] CALL step() [L39] var_1_14 = var_1_8 [L40] var_1_16 = var_1_14 [L41] signed long int stepLocal_0 = (((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)); VAL [isInitial=1, stepLocal_0=63, var_1_10=6, var_1_11=0, var_1_13=-2147483649, var_1_14=63, var_1_15=256, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=63, var_1_9=0] [L42] COND FALSE !(var_1_2 <= stepLocal_0) [L45] var_1_7 = var_1_10 VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=-2147483649, var_1_14=63, var_1_15=256, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L47] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=-2147483649, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L48] EXPR (var_1_2 - var_1_3) ^ (var_1_15 * var_1_16) VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=-2147483649, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L48] COND FALSE !(((var_1_2 - var_1_3) ^ (var_1_15 * var_1_16)) <= -64) [L51] var_1_1 = var_1_6 VAL [isInitial=1, var_1_10=6, var_1_11=0, var_1_13=-2147483649, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L53] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_1=0, var_1_10=6, var_1_11=0, var_1_13=-2147483649, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L54] COND TRUE 2.75f > var_1_12 [L55] var_1_11 = (var_1_10 + var_1_8) VAL [isInitial=1, stepLocal_1=0, var_1_10=6, var_1_11=69, var_1_13=-2147483649, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR (var_1_2 - var_1_3) ^ (var_1_15 * var_1_16) VAL [isInitial=1, var_1_10=6, var_1_11=69, var_1_13=-2147483649, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L90-L91] return ((((((((var_1_2 - var_1_3) ^ (var_1_15 * var_1_16)) <= -64) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_2 <= ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_7 == ((signed char) ((var_1_8 - (1 + var_1_9)) + var_1_10))) : (var_1_7 == ((signed char) var_1_10)))) && ((2.75f > var_1_12) ? (var_1_11 == ((signed char) (var_1_10 + var_1_8))) : (((var_1_13 - ((((var_1_14) > (var_1_8)) ? (var_1_14) : (var_1_8)))) > var_1_1) ? (var_1_11 == ((signed char) ((((((((var_1_8) < ((1 + 5))) ? (var_1_8) : ((1 + 5))))) < (var_1_10)) ? (((((var_1_8) < ((1 + 5))) ? (var_1_8) : ((1 + 5))))) : (var_1_10))))) : 1))) && (var_1_14 == ((signed long int) var_1_8))) && (var_1_15 == ((signed long int) var_1_16))) && (var_1_16 == ((signed short int) var_1_14)) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=6, var_1_11=69, var_1_13=-2147483649, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=6, var_1_11=69, var_1_13=-2147483649, var_1_14=63, var_1_15=63, var_1_16=63, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=6, var_1_8=63, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.8s, OverallIterations: 4, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 294 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 294 mSDsluCounter, 426 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 216 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 292 IncrementalHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 210 mSDtfsCounter, 292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 30.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=3, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 48 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 28.2s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 570 ConstructedInterpolants, 1 QuantifiedInterpolants, 2228 SizeOfPredicates, 7 NumberOfNonLiveVariables, 464 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2271/2520 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-24 11:05:44,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 705f1434cf57fe07ebfc06c0b1211b5e86887658700ddfe642f1846035ec4c01 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:05:46,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:05:46,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:05:46,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:05:46,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:05:46,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:05:46,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:05:46,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:05:46,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:05:46,463 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:05:46,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:05:46,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:05:46,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:05:46,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:05:46,466 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:05:46,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:05:46,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:05:46,467 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:05:46,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:05:46,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:05:46,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:05:46,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:05:46,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:05:46,472 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:05:46,472 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:05:46,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:05:46,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:05:46,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:05:46,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:05:46,473 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:05:46,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:05:46,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:05:46,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:05:46,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:05:46,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:05:46,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:05:46,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:05:46,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:05:46,480 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:05:46,480 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:05:46,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:05:46,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:05:46,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:05:46,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:05:46,482 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:05:46,482 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 705f1434cf57fe07ebfc06c0b1211b5e86887658700ddfe642f1846035ec4c01 [2024-10-24 11:05:46,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:05:46,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:05:46,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:05:46,813 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:05:46,813 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:05:46,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i [2024-10-24 11:05:48,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:05:48,567 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:05:48,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-37.i [2024-10-24 11:05:48,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c133be35/e283d7139b71453fb064fcb044074d1d/FLAGf83b23dcb [2024-10-24 11:05:48,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c133be35/e283d7139b71453fb064fcb044074d1d [2024-10-24 11:05:48,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:05:48,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:05:48,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:05:48,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:05:48,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:05:48,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:05:48" (1/1) ... [2024-10-24 11:05:48,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d75ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:48, skipping insertion in model container [2024-10-24 11:05:48,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:05:48" (1/1) ... [2024-10-24 11:05:48,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:05:48,832 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-37.i[913,926] [2024-10-24 11:05:48,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:05:48,904 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:05:48,915 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-37.i[913,926] [2024-10-24 11:05:48,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:05:48,964 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:05:48,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:48 WrapperNode [2024-10-24 11:05:48,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:05:48,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:05:48,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:05:48,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:05:48,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:48" (1/1) ... [2024-10-24 11:05:48,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:48" (1/1) ... [2024-10-24 11:05:49,022 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-10-24 11:05:49,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:05:49,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:05:49,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:05:49,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:05:49,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:48" (1/1) ... [2024-10-24 11:05:49,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:48" (1/1) ... [2024-10-24 11:05:49,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:48" (1/1) ... [2024-10-24 11:05:49,055 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-24 11:05:49,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:48" (1/1) ... [2024-10-24 11:05:49,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:48" (1/1) ... [2024-10-24 11:05:49,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:48" (1/1) ... [2024-10-24 11:05:49,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:48" (1/1) ... [2024-10-24 11:05:49,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:48" (1/1) ... [2024-10-24 11:05:49,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:48" (1/1) ... [2024-10-24 11:05:49,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:05:49,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:05:49,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:05:49,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:05:49,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:48" (1/1) ... [2024-10-24 11:05:49,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:05:49,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:05:49,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:05:49,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:05:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:05:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:05:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:05:49,158 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:05:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:05:49,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:05:49,242 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:05:49,244 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:05:49,513 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 11:05:49,513 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:05:49,571 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:05:49,572 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:05:49,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:05:49 BoogieIcfgContainer [2024-10-24 11:05:49,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:05:49,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:05:49,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:05:49,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:05:49,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:05:48" (1/3) ... [2024-10-24 11:05:49,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41cb44a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:05:49, skipping insertion in model container [2024-10-24 11:05:49,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:05:48" (2/3) ... [2024-10-24 11:05:49,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41cb44a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:05:49, skipping insertion in model container [2024-10-24 11:05:49,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:05:49" (3/3) ... [2024-10-24 11:05:49,585 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-37.i [2024-10-24 11:05:49,601 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:05:49,602 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:05:49,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:05:49,677 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;@20baddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:05:49,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:05:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:05:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:05:49,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:05:49,693 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:05:49,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:05:49,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:05:49,699 INFO L85 PathProgramCache]: Analyzing trace with hash 25155256, now seen corresponding path program 1 times [2024-10-24 11:05:49,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:05:49,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133010622] [2024-10-24 11:05:49,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:49,714 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-24 11:05:49,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:05:49,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:05:49,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:05:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:49,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:05:49,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:05:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-24 11:05:49,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:05:49,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:05:49,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133010622] [2024-10-24 11:05:49,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133010622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:05:49,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:05:49,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:05:49,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448981447] [2024-10-24 11:05:49,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:05:49,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:05:49,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:05:50,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:05:50,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:05:50,007 INFO L87 Difference]: Start difference. First operand has 42 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:05:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:05:50,046 INFO L93 Difference]: Finished difference Result 81 states and 139 transitions. [2024-10-24 11:05:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:05:50,049 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 93 [2024-10-24 11:05:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:05:50,056 INFO L225 Difference]: With dead ends: 81 [2024-10-24 11:05:50,056 INFO L226 Difference]: Without dead ends: 40 [2024-10-24 11:05:50,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-24 11:05:50,063 INFO L432 NwaCegarLoop]: 55 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, 55 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-24 11:05:50,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:05:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-24 11:05:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-24 11:05:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:05:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2024-10-24 11:05:50,104 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 93 [2024-10-24 11:05:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:05:50,104 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2024-10-24 11:05:50,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:05:50,105 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2024-10-24 11:05:50,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:05:50,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:05:50,108 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:05:50,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:05:50,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:05:50,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:05:50,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:05:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2103298054, now seen corresponding path program 1 times [2024-10-24 11:05:50,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:05:50,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177542866] [2024-10-24 11:05:50,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:50,318 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-24 11:05:50,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:05:50,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:05:50,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:05:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:50,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:05:50,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:05:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-24 11:05:50,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:05:51,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:05:51,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177542866] [2024-10-24 11:05:51,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177542866] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:05:51,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [909607837] [2024-10-24 11:05:51,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:51,249 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:05:51,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:05:51,254 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:05:51,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-24 11:05:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:51,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:05:51,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:05:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-24 11:05:51,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:05:51,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [909607837] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:05:51,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:05:51,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-10-24 11:05:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813577014] [2024-10-24 11:05:51,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:05:51,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:05:51,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:05:51,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:05:51,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:05:51,967 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:05:52,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:05:52,394 INFO L93 Difference]: Finished difference Result 91 states and 125 transitions. [2024-10-24 11:05:52,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:05:52,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 93 [2024-10-24 11:05:52,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:05:52,396 INFO L225 Difference]: With dead ends: 91 [2024-10-24 11:05:52,397 INFO L226 Difference]: Without dead ends: 52 [2024-10-24 11:05:52,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:05:52,398 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:05:52,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 120 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:05:52,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-24 11:05:52,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2024-10-24 11:05:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:05:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2024-10-24 11:05:52,416 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 93 [2024-10-24 11:05:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:05:52,417 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2024-10-24 11:05:52,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:05:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2024-10-24 11:05:52,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:05:52,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:05:52,421 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:05:52,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:05:52,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:05:52,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:05:52,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:05:52,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:05:52,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1382322616, now seen corresponding path program 1 times [2024-10-24 11:05:52,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:05:52,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125299763] [2024-10-24 11:05:52,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:52,824 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-24 11:05:52,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:05:52,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:05:52,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:05:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:52,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 11:05:52,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:05:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 222 proven. 102 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-24 11:05:53,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:05:57,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:05:57,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125299763] [2024-10-24 11:05:57,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125299763] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:05:57,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [778290925] [2024-10-24 11:05:57,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:05:57,065 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:05:57,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:05:57,068 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:05:57,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-24 11:05:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:05:57,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 11:05:57,318 INFO L278 TraceCheckSpWp]: Computing forward predicates...