./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.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 bdb04820b0552f240cac64f9b4eeb39d6636c8d16d50737ca938c89bab3fc009 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:24:32,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:24:32,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:24:32,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:24:32,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:24:32,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:24:32,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:24:32,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:24:32,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:24:32,355 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:24:32,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:24:32,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:24:32,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:24:32,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:24:32,358 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:24:32,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:24:32,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:24:32,359 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:24:32,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:24:32,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:24:32,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:24:32,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:24:32,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:24:32,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:24:32,365 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:24:32,365 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:24:32,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:24:32,365 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:24:32,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:24:32,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:24:32,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:24:32,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:24:32,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:24:32,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:24:32,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:24:32,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:24:32,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:24:32,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:24:32,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:24:32,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:24:32,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:24:32,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:24:32,373 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 -> bdb04820b0552f240cac64f9b4eeb39d6636c8d16d50737ca938c89bab3fc009 [2024-11-10 03:24:32,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:24:32,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:24:32,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:24:32,667 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:24:32,667 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:24:32,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.i [2024-11-10 03:24:34,216 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:24:34,430 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:24:34,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.i [2024-11-10 03:24:34,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc6ca789/2a6f41ba7f5c4b1db8403255bb4268fe/FLAG67b3eb7e8 [2024-11-10 03:24:34,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecc6ca789/2a6f41ba7f5c4b1db8403255bb4268fe [2024-11-10 03:24:34,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:24:34,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:24:34,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:24:34,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:24:34,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:24:34,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:24:34" (1/1) ... [2024-11-10 03:24:34,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a78dd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:34, skipping insertion in model container [2024-11-10 03:24:34,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:24:34" (1/1) ... [2024-11-10 03:24:34,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:24:34,673 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.i[913,926] [2024-11-10 03:24:34,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:24:34,743 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:24:34,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.i[913,926] [2024-11-10 03:24:34,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:24:34,810 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:24:34,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:34 WrapperNode [2024-11-10 03:24:34,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:24:34,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:24:34,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:24:34,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:24:34,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:34" (1/1) ... [2024-11-10 03:24:34,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:34" (1/1) ... [2024-11-10 03:24:34,878 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-11-10 03:24:34,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:24:34,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:24:34,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:24:34,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:24:34,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:34" (1/1) ... [2024-11-10 03:24:34,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:34" (1/1) ... [2024-11-10 03:24:34,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:34" (1/1) ... [2024-11-10 03:24:34,927 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:24:34,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:34" (1/1) ... [2024-11-10 03:24:34,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:34" (1/1) ... [2024-11-10 03:24:34,946 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:34" (1/1) ... [2024-11-10 03:24:34,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:34" (1/1) ... [2024-11-10 03:24:34,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:34" (1/1) ... [2024-11-10 03:24:34,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:34" (1/1) ... [2024-11-10 03:24:34,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:24:34,967 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:24:34,968 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:24:34,968 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:24:34,969 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:34" (1/1) ... [2024-11-10 03:24:34,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:24:34,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:24:35,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:24:35,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:24:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:24:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:24:35,056 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:24:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:24:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:24:35,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:24:35,126 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:24:35,128 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:24:35,519 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: havoc property_#t~bitwise13#1; [2024-11-10 03:24:35,552 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 03:24:35,552 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:24:35,612 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:24:35,613 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:24:35,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:24:35 BoogieIcfgContainer [2024-11-10 03:24:35,613 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:24:35,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:24:35,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:24:35,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:24:35,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:24:34" (1/3) ... [2024-11-10 03:24:35,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19875f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:24:35, skipping insertion in model container [2024-11-10 03:24:35,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:34" (2/3) ... [2024-11-10 03:24:35,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19875f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:24:35, skipping insertion in model container [2024-11-10 03:24:35,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:24:35" (3/3) ... [2024-11-10 03:24:35,637 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-68.i [2024-11-10 03:24:35,684 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:24:35,684 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:24:35,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:24:35,760 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;@4f87519e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:24:35,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:24:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 03:24:35,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 03:24:35,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:24:35,781 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:24:35,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:24:35,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:24:35,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1228788428, now seen corresponding path program 1 times [2024-11-10 03:24:35,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:24:35,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110028488] [2024-11-10 03:24:35,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:35,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:24:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:24:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:24:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:24:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:24:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:24:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:24:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:24:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:24:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:24:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:24:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:24:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:24:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:24:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:24:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:24:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:24:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 03:24:36,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:24:36,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110028488] [2024-11-10 03:24:36,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110028488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:24:36,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:24:36,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:24:36,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936631973] [2024-11-10 03:24:36,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:24:36,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:24:36,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:24:36,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:24:36,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:24:36,264 INFO L87 Difference]: Start difference. First operand has 66 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 03:24:36,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:24:36,311 INFO L93 Difference]: Finished difference Result 124 states and 209 transitions. [2024-11-10 03:24:36,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:24:36,314 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 109 [2024-11-10 03:24:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:24:36,323 INFO L225 Difference]: With dead ends: 124 [2024-11-10 03:24:36,323 INFO L226 Difference]: Without dead ends: 61 [2024-11-10 03:24:36,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:24:36,332 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:24:36,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:24:36,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-10 03:24:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-10 03:24:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 03:24:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2024-11-10 03:24:36,394 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 109 [2024-11-10 03:24:36,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:24:36,395 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 91 transitions. [2024-11-10 03:24:36,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 03:24:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2024-11-10 03:24:36,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 03:24:36,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:24:36,399 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:24:36,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:24:36,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:24:36,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:24:36,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1545221797, now seen corresponding path program 1 times [2024-11-10 03:24:36,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:24:36,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476855973] [2024-11-10 03:24:36,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:36,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:24:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:24:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:24:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:24:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:24:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:24:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:24:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:24:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:24:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:24:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:24:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:24:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:24:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:24:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:24:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:24:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:24:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 03:24:37,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:24:37,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476855973] [2024-11-10 03:24:37,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476855973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:24:37,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:24:37,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:24:37,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421305588] [2024-11-10 03:24:37,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:24:37,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:24:37,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:24:37,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:24:37,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:24:37,098 INFO L87 Difference]: Start difference. First operand 61 states and 91 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:24:37,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:24:37,272 INFO L93 Difference]: Finished difference Result 155 states and 225 transitions. [2024-11-10 03:24:37,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:24:37,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-11-10 03:24:37,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:24:37,277 INFO L225 Difference]: With dead ends: 155 [2024-11-10 03:24:37,279 INFO L226 Difference]: Without dead ends: 97 [2024-11-10 03:24:37,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:24:37,282 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 107 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:24:37,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 162 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:24:37,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-10 03:24:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 66. [2024-11-10 03:24:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 03:24:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2024-11-10 03:24:37,311 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 110 [2024-11-10 03:24:37,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:24:37,312 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2024-11-10 03:24:37,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:24:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2024-11-10 03:24:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 03:24:37,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:24:37,317 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:24:37,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:24:37,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:24:37,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:24:37,319 INFO L85 PathProgramCache]: Analyzing trace with hash 952794140, now seen corresponding path program 1 times [2024-11-10 03:24:37,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:24:37,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916299607] [2024-11-10 03:24:37,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:37,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:24:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:24:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:24:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:24:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:24:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:24:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:24:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:24:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:24:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:24:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:24:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:24:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:24:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:24:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:24:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:24:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:24:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 03:24:37,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:24:37,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916299607] [2024-11-10 03:24:37,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916299607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:24:37,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556608406] [2024-11-10 03:24:37,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:37,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:24:37,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:24:37,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:24:37,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 03:24:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:37,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 03:24:37,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:24:38,122 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-11-10 03:24:38,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:24:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 03:24:38,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556608406] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:24:38,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 03:24:38,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 03:24:38,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231497766] [2024-11-10 03:24:38,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 03:24:38,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:24:38,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:24:38,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:24:38,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:24:38,385 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 03:24:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:24:38,576 INFO L93 Difference]: Finished difference Result 136 states and 192 transitions. [2024-11-10 03:24:38,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:24:38,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 110 [2024-11-10 03:24:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:24:38,578 INFO L225 Difference]: With dead ends: 136 [2024-11-10 03:24:38,578 INFO L226 Difference]: Without dead ends: 73 [2024-11-10 03:24:38,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:24:38,580 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 92 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:24:38,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 156 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:24:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-10 03:24:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2024-11-10 03:24:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 03:24:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2024-11-10 03:24:38,591 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 110 [2024-11-10 03:24:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:24:38,592 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2024-11-10 03:24:38,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 03:24:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2024-11-10 03:24:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 03:24:38,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:24:38,594 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:24:38,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 03:24:38,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:24:38,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:24:38,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:24:38,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1399245099, now seen corresponding path program 1 times [2024-11-10 03:24:38,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:24:38,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273599847] [2024-11-10 03:24:38,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:38,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:24:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:24:38,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [530094006] [2024-11-10 03:24:38,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:38,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:24:38,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:24:38,912 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:24:38,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 03:24:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:24:39,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:24:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:24:39,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:24:39,148 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:24:39,150 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:24:39,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 03:24:39,353 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,SelfDestructingSolverStorable3 [2024-11-10 03:24:39,358 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 03:24:39,440 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:24:39,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:24:39 BoogieIcfgContainer [2024-11-10 03:24:39,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:24:39,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:24:39,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:24:39,445 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:24:39,445 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:24:35" (3/4) ... [2024-11-10 03:24:39,449 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:24:39,450 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:24:39,450 INFO L158 Benchmark]: Toolchain (without parser) took 4989.73ms. Allocated memory was 165.7MB in the beginning and 222.3MB in the end (delta: 56.6MB). Free memory was 110.4MB in the beginning and 97.3MB in the end (delta: 13.1MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. [2024-11-10 03:24:39,450 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 165.7MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:24:39,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.02ms. Allocated memory is still 165.7MB. Free memory was 110.4MB in the beginning and 95.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 03:24:39,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.49ms. Allocated memory is still 165.7MB. Free memory was 95.1MB in the beginning and 91.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:24:39,451 INFO L158 Benchmark]: Boogie Preprocessor took 86.87ms. Allocated memory is still 165.7MB. Free memory was 91.0MB in the beginning and 86.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:24:39,453 INFO L158 Benchmark]: IcfgBuilder took 646.24ms. Allocated memory is still 165.7MB. Free memory was 86.3MB in the beginning and 133.7MB in the end (delta: -47.4MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2024-11-10 03:24:39,453 INFO L158 Benchmark]: TraceAbstraction took 3823.62ms. Allocated memory was 165.7MB in the beginning and 222.3MB in the end (delta: 56.6MB). Free memory was 132.8MB in the beginning and 97.3MB in the end (delta: 35.5MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. [2024-11-10 03:24:39,453 INFO L158 Benchmark]: Witness Printer took 5.36ms. Allocated memory is still 222.3MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:24:39,455 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.11ms. Allocated memory is still 165.7MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.02ms. Allocated memory is still 165.7MB. Free memory was 110.4MB in the beginning and 95.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.49ms. Allocated memory is still 165.7MB. Free memory was 95.1MB in the beginning and 91.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.87ms. Allocated memory is still 165.7MB. Free memory was 91.0MB in the beginning and 86.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 646.24ms. Allocated memory is still 165.7MB. Free memory was 86.3MB in the beginning and 133.7MB in the end (delta: -47.4MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3823.62ms. Allocated memory was 165.7MB in the beginning and 222.3MB in the end (delta: 56.6MB). Free memory was 132.8MB in the beginning and 97.3MB in the end (delta: 35.5MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. * Witness Printer took 5.36ms. Allocated memory is still 222.3MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 10; [L24] unsigned char var_1_3 = 25; [L25] unsigned char var_1_4 = 16; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 32; [L30] double var_1_9 = 4.6; [L31] double var_1_10 = 9.25; [L32] double var_1_11 = 1.25; [L33] unsigned char var_1_12 = 100; [L34] unsigned char var_1_13 = 64; [L35] unsigned char var_1_14 = 0; [L36] float var_1_15 = 7.5; [L37] signed long int var_1_16 = 0; VAL [isInitial=0, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=10, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] FCALL updateLastVariables() [L119] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L84] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L85] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L85] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L86] var_1_3 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L87] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L88] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L88] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L89] var_1_4 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L90] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L91] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L91] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L92] var_1_5 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L93] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L94] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L94] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L95] var_1_7 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L96] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L97] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L97] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L98] var_1_8 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L99] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L100] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L100] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L101] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L101] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L102] var_1_10 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L103] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L104] var_1_13 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L105] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L106] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L106] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L119] RET updateVariables() [L120] CALL step() [L41] EXPR var_1_3 ^ var_1_4 VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L41] COND TRUE var_1_2 <= (var_1_3 ^ var_1_4) [L42] var_1_1 = (! var_1_5) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=-256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L46] COND FALSE !(-256 >= var_1_3) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=-256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L49] COND TRUE (var_1_2 < (var_1_4 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1) [L50] var_1_6 = var_1_7 VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=-256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=23/5] [L53] COND TRUE ((((((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) > (var_1_4)) ? (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) <= (50 * var_1_8) [L54] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=2, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=-256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L56] COND TRUE (var_1_7 && var_1_1) || (! var_1_5) [L57] var_1_11 = var_1_10 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=-256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L59] COND TRUE \read(var_1_1) VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=-256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L60] COND FALSE !(var_1_10 >= (- var_1_9)) [L67] var_1_12 = var_1_13 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=-256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L72] COND FALSE !((var_1_13 % (5u + 256u)) <= var_1_2) VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=-256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L79] var_1_15 = var_1_10 [L80] var_1_16 = var_1_3 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=-256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L120] RET step() [L121] CALL, EXPR property() [L111] EXPR var_1_3 ^ var_1_4 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=-256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L111-L112] return ((((((((var_1_2 <= (var_1_3 ^ var_1_4)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_3) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_2 < (var_1_4 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) > (var_1_4)) ? (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_1) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (var_1_1 ? ((var_1_10 >= (- var_1_9)) ? ((var_1_8 != var_1_3) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_2) ? (((var_1_13 + 16) >= var_1_2) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) var_1_3)) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=-256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=-256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 252 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 346 GetRequests, 334 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=3, InterpolantAutomatonStates: 15, 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, 35 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 661 NumberOfCodeBlocks, 661 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 544 ConstructedInterpolants, 0 QuantifiedInterpolants, 1030 SizeOfPredicates, 1 NumberOfNonLiveVariables, 257 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 2328/2400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:24:39,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.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 bdb04820b0552f240cac64f9b4eeb39d6636c8d16d50737ca938c89bab3fc009 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:24:41,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:24:42,007 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:24:42,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:24:42,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:24:42,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:24:42,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:24:42,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:24:42,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:24:42,054 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:24:42,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:24:42,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:24:42,056 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:24:42,056 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:24:42,056 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:24:42,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:24:42,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:24:42,058 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:24:42,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:24:42,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:24:42,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:24:42,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:24:42,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:24:42,063 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:24:42,063 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:24:42,064 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:24:42,064 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:24:42,064 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:24:42,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:24:42,065 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:24:42,065 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:24:42,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:24:42,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:24:42,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:24:42,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:24:42,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:24:42,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:24:42,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:24:42,069 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:24:42,070 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:24:42,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:24:42,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:24:42,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:24:42,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:24:42,071 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 -> bdb04820b0552f240cac64f9b4eeb39d6636c8d16d50737ca938c89bab3fc009 [2024-11-10 03:24:42,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:24:42,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:24:42,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:24:42,481 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:24:42,482 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:24:42,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.i [2024-11-10 03:24:44,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:24:44,387 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:24:44,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.i [2024-11-10 03:24:44,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dbf37889/83894f5df97f4a0a832abb518965aa1a/FLAG5dfa4f15f [2024-11-10 03:24:44,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dbf37889/83894f5df97f4a0a832abb518965aa1a [2024-11-10 03:24:44,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:24:44,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:24:44,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:24:44,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:24:44,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:24:44,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:24:44" (1/1) ... [2024-11-10 03:24:44,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49af9558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:44, skipping insertion in model container [2024-11-10 03:24:44,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:24:44" (1/1) ... [2024-11-10 03:24:44,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:24:44,973 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.i[913,926] [2024-11-10 03:24:45,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:24:45,071 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:24:45,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.i[913,926] [2024-11-10 03:24:45,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:24:45,154 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:24:45,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:45 WrapperNode [2024-11-10 03:24:45,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:24:45,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:24:45,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:24:45,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:24:45,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:45" (1/1) ... [2024-11-10 03:24:45,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:45" (1/1) ... [2024-11-10 03:24:45,212 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-10 03:24:45,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:24:45,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:24:45,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:24:45,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:24:45,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:45" (1/1) ... [2024-11-10 03:24:45,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:45" (1/1) ... [2024-11-10 03:24:45,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:45" (1/1) ... [2024-11-10 03:24:45,263 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:24:45,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:45" (1/1) ... [2024-11-10 03:24:45,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:45" (1/1) ... [2024-11-10 03:24:45,276 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:45" (1/1) ... [2024-11-10 03:24:45,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:45" (1/1) ... [2024-11-10 03:24:45,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:45" (1/1) ... [2024-11-10 03:24:45,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:45" (1/1) ... [2024-11-10 03:24:45,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:24:45,292 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:24:45,292 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:24:45,294 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:24:45,295 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:45" (1/1) ... [2024-11-10 03:24:45,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:24:45,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:24:45,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:24:45,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:24:45,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:24:45,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:24:45,387 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:24:45,387 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:24:45,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:24:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:24:45,484 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:24:45,487 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:24:46,031 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:24:46,032 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:24:46,045 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:24:46,049 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:24:46,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:24:46 BoogieIcfgContainer [2024-11-10 03:24:46,050 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:24:46,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:24:46,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:24:46,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:24:46,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:24:44" (1/3) ... [2024-11-10 03:24:46,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d34f3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:24:46, skipping insertion in model container [2024-11-10 03:24:46,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:24:45" (2/3) ... [2024-11-10 03:24:46,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d34f3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:24:46, skipping insertion in model container [2024-11-10 03:24:46,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:24:46" (3/3) ... [2024-11-10 03:24:46,059 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-68.i [2024-11-10 03:24:46,079 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:24:46,079 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:24:46,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:24:46,169 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;@7cd23fcb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:24:46,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:24:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 03:24:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 03:24:46,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:24:46,191 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:24:46,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:24:46,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:24:46,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1320366234, now seen corresponding path program 1 times [2024-11-10 03:24:46,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:24:46,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020335350] [2024-11-10 03:24:46,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:46,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:24:46,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:24:46,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:24:46,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:24:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:46,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:24:46,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:24:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-10 03:24:46,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:24:46,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:24:46,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020335350] [2024-11-10 03:24:46,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020335350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:24:46,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:24:46,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:24:46,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866725520] [2024-11-10 03:24:46,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:24:46,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:24:46,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:24:46,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:24:46,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:24:46,596 INFO L87 Difference]: Start difference. First operand has 57 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 03:24:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:24:46,627 INFO L93 Difference]: Finished difference Result 106 states and 179 transitions. [2024-11-10 03:24:46,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:24:46,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2024-11-10 03:24:46,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:24:46,640 INFO L225 Difference]: With dead ends: 106 [2024-11-10 03:24:46,640 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 03:24:46,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:24:46,652 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:24:46,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:24:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 03:24:46,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-10 03:24:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 03:24:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-11-10 03:24:46,705 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 106 [2024-11-10 03:24:46,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:24:46,706 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-11-10 03:24:46,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 03:24:46,707 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-11-10 03:24:46,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 03:24:46,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:24:46,713 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:24:46,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:24:46,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:24:46,918 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:24:46,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:24:46,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1753357047, now seen corresponding path program 1 times [2024-11-10 03:24:46,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:24:46,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652792382] [2024-11-10 03:24:46,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:46,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:24:46,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:24:46,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:24:46,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:24:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:47,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 03:24:47,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:24:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-11-10 03:24:47,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:24:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 03:24:47,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:24:47,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652792382] [2024-11-10 03:24:47,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652792382] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:24:47,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:24:47,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-10 03:24:47,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151432663] [2024-11-10 03:24:47,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:24:47,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 03:24:47,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:24:47,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 03:24:47,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:24:47,859 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 03:24:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:24:48,601 INFO L93 Difference]: Finished difference Result 109 states and 156 transitions. [2024-11-10 03:24:48,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 03:24:48,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 107 [2024-11-10 03:24:48,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:24:48,615 INFO L225 Difference]: With dead ends: 109 [2024-11-10 03:24:48,616 INFO L226 Difference]: Without dead ends: 60 [2024-11-10 03:24:48,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-10 03:24:48,618 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 108 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 03:24:48,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 115 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 03:24:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-10 03:24:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-11-10 03:24:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 03:24:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2024-11-10 03:24:48,632 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 107 [2024-11-10 03:24:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:24:48,633 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2024-11-10 03:24:48,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 03:24:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2024-11-10 03:24:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 03:24:48,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:24:48,636 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:24:48,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 03:24:48,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:24:48,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:24:48,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:24:48,843 INFO L85 PathProgramCache]: Analyzing trace with hash -107900161, now seen corresponding path program 1 times [2024-11-10 03:24:48,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:24:48,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346587298] [2024-11-10 03:24:48,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:24:48,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:24:48,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:24:48,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:24:48,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 03:24:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:24:48,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 03:24:49,004 INFO L278 TraceCheckSpWp]: Computing forward predicates...