./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aaf221d7158743008ea81fbb0e586b6f2b82c6a21578c56e13bae7eee02457d5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:44:27,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:44:27,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:44:27,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:44:27,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:44:27,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:44:27,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:44:27,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:44:27,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:44:27,895 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:44:27,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:44:27,896 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:44:27,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:44:27,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:44:27,900 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:44:27,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:44:27,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:44:27,901 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:44:27,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:44:27,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:44:27,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:44:27,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:44:27,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:44:27,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:44:27,906 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:44:27,906 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:44:27,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:44:27,907 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:44:27,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:44:27,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:44:27,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:44:27,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:44:27,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:44:27,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:44:27,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:44:27,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:44:27,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:44:27,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:44:27,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:44:27,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:44:27,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:44:27,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:44:27,912 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aaf221d7158743008ea81fbb0e586b6f2b82c6a21578c56e13bae7eee02457d5 [2024-10-11 10:44:28,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:44:28,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:44:28,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:44:28,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:44:28,225 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:44:28,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i [2024-10-11 10:44:29,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:44:29,861 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:44:29,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i [2024-10-11 10:44:29,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2a7215352/27ee85a0c3a64e628e50530fd497d1e2/FLAGb85d4ffcd [2024-10-11 10:44:30,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2a7215352/27ee85a0c3a64e628e50530fd497d1e2 [2024-10-11 10:44:30,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:44:30,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:44:30,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:44:30,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:44:30,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:44:30,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:44:30" (1/1) ... [2024-10-11 10:44:30,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e00cf4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:30, skipping insertion in model container [2024-10-11 10:44:30,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:44:30" (1/1) ... [2024-10-11 10:44:30,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:44:30,446 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i[917,930] [2024-10-11 10:44:30,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:44:30,523 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:44:30,538 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i[917,930] [2024-10-11 10:44:30,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:44:30,584 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:44:30,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:30 WrapperNode [2024-10-11 10:44:30,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:44:30,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:44:30,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:44:30,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:44:30,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:30" (1/1) ... [2024-10-11 10:44:30,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:30" (1/1) ... [2024-10-11 10:44:30,631 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-10-11 10:44:30,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:44:30,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:44:30,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:44:30,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:44:30,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:30" (1/1) ... [2024-10-11 10:44:30,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:30" (1/1) ... [2024-10-11 10:44:30,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:30" (1/1) ... [2024-10-11 10:44:30,663 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:44:30,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:30" (1/1) ... [2024-10-11 10:44:30,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:30" (1/1) ... [2024-10-11 10:44:30,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:30" (1/1) ... [2024-10-11 10:44:30,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:30" (1/1) ... [2024-10-11 10:44:30,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:30" (1/1) ... [2024-10-11 10:44:30,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:30" (1/1) ... [2024-10-11 10:44:30,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:44:30,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:44:30,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:44:30,689 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:44:30,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:30" (1/1) ... [2024-10-11 10:44:30,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:44:30,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:44:30,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:44:30,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:44:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:44:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:44:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:44:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:44:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:44:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:44:30,912 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:44:30,914 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:44:31,185 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:44:31,186 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:44:31,254 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:44:31,255 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:44:31,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:44:31 BoogieIcfgContainer [2024-10-11 10:44:31,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:44:31,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:44:31,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:44:31,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:44:31,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:44:30" (1/3) ... [2024-10-11 10:44:31,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2122cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:44:31, skipping insertion in model container [2024-10-11 10:44:31,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:30" (2/3) ... [2024-10-11 10:44:31,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2122cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:44:31, skipping insertion in model container [2024-10-11 10:44:31,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:44:31" (3/3) ... [2024-10-11 10:44:31,265 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-35.i [2024-10-11 10:44:31,279 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:44:31,280 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:44:31,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:44:31,343 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;@19172eb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:44:31,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:44:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:44:31,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 10:44:31,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:31,366 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:31,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:31,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash -628824035, now seen corresponding path program 1 times [2024-10-11 10:44:31,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:31,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413574408] [2024-10-11 10:44:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:31,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:44:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:44:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:44:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:44:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:44:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:44:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:44:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:44:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:44:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:44:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:44:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:44:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:44:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:44:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:44:31,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:31,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413574408] [2024-10-11 10:44:31,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413574408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:31,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:31,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:44:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726835923] [2024-10-11 10:44:31,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:31,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:44:31,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:31,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:44:31,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:44:31,835 INFO L87 Difference]: Start difference. First operand has 48 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 10:44:31,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:31,876 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2024-10-11 10:44:31,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:44:31,879 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2024-10-11 10:44:31,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:31,884 INFO L225 Difference]: With dead ends: 93 [2024-10-11 10:44:31,885 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 10:44:31,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:44:31,891 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:31,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:44:31,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 10:44:31,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 10:44:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:44:31,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2024-10-11 10:44:31,984 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 111 [2024-10-11 10:44:31,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:31,986 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 69 transitions. [2024-10-11 10:44:31,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 10:44:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2024-10-11 10:44:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 10:44:31,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:31,995 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:31,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:44:32,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:32,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:32,017 INFO L85 PathProgramCache]: Analyzing trace with hash -855102303, now seen corresponding path program 1 times [2024-10-11 10:44:32,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:32,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880366367] [2024-10-11 10:44:32,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:32,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:44:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:44:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:44:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:44:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:44:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:44:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:44:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:44:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:44:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:44:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:44:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:44:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:44:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:44:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:44:32,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:32,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880366367] [2024-10-11 10:44:32,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880366367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:32,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:32,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:44:32,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865398786] [2024-10-11 10:44:32,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:32,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:44:32,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:32,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:44:32,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:32,343 INFO L87 Difference]: Start difference. First operand 46 states and 69 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:44:32,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:32,407 INFO L93 Difference]: Finished difference Result 134 states and 201 transitions. [2024-10-11 10:44:32,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:44:32,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2024-10-11 10:44:32,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:32,412 INFO L225 Difference]: With dead ends: 134 [2024-10-11 10:44:32,412 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 10:44:32,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:32,415 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 62 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:32,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 125 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:44:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 10:44:32,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 47. [2024-10-11 10:44:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:44:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 69 transitions. [2024-10-11 10:44:32,439 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 69 transitions. Word has length 111 [2024-10-11 10:44:32,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:32,442 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 69 transitions. [2024-10-11 10:44:32,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:44:32,442 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 69 transitions. [2024-10-11 10:44:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 10:44:32,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:32,445 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:32,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:44:32,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:32,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:32,447 INFO L85 PathProgramCache]: Analyzing trace with hash -853255261, now seen corresponding path program 1 times [2024-10-11 10:44:32,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:32,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163822098] [2024-10-11 10:44:32,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:44:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:44:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:44:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:44:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:44:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:44:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:44:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:44:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:44:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:44:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:44:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:44:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:44:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:44:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:44:32,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:32,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163822098] [2024-10-11 10:44:32,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163822098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:32,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:32,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:44:32,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977547323] [2024-10-11 10:44:32,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:32,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:44:32,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:32,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:44:32,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:32,693 INFO L87 Difference]: Start difference. First operand 47 states and 69 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:44:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:32,727 INFO L93 Difference]: Finished difference Result 93 states and 137 transitions. [2024-10-11 10:44:32,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:44:32,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2024-10-11 10:44:32,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:32,733 INFO L225 Difference]: With dead ends: 93 [2024-10-11 10:44:32,733 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 10:44:32,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:32,735 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:32,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:44:32,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 10:44:32,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-11 10:44:32,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:44:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-10-11 10:44:32,751 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 111 [2024-10-11 10:44:32,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:32,752 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-10-11 10:44:32,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:44:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-10-11 10:44:32,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 10:44:32,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:32,755 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:32,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:44:32,756 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:32,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1533313631, now seen corresponding path program 1 times [2024-10-11 10:44:32,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:32,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040412777] [2024-10-11 10:44:32,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:32,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:44:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:44:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:44:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:44:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:44:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 10:44:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:44:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:44:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:44:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:44:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:44:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:44:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:44:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:44:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:44:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:44:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:44:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:44:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-11 10:44:33,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:44:33,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040412777] [2024-10-11 10:44:33,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040412777] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:44:33,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553063224] [2024-10-11 10:44:33,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:33,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:44:33,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:44:33,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:44:33,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:44:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:33,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 10:44:33,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:44:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 303 proven. 18 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-10-11 10:44:33,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:44:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-11 10:44:33,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553063224] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:44:33,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:44:33,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-11 10:44:33,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516366756] [2024-10-11 10:44:33,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:44:33,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 10:44:33,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:44:33,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 10:44:33,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:44:33,923 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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-10-11 10:44:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:34,485 INFO L93 Difference]: Finished difference Result 204 states and 282 transitions. [2024-10-11 10:44:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 10:44:34,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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 111 [2024-10-11 10:44:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:34,490 INFO L225 Difference]: With dead ends: 204 [2024-10-11 10:44:34,490 INFO L226 Difference]: Without dead ends: 158 [2024-10-11 10:44:34,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 253 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2024-10-11 10:44:34,495 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 172 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:34,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 194 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:44:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-11 10:44:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 52. [2024-10-11 10:44:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:44:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2024-10-11 10:44:34,520 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 111 [2024-10-11 10:44:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:34,521 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2024-10-11 10:44:34,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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-10-11 10:44:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2024-10-11 10:44:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 10:44:34,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:34,523 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:34,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 10:44:34,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:44:34,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:34,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:34,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1476055329, now seen corresponding path program 1 times [2024-10-11 10:44:34,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:44:34,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138238054] [2024-10-11 10:44:34,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:44:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:44:34,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:44:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:44:34,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:44:34,890 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:44:34,891 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:44:34,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:44:34,896 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 10:44:34,982 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:44:34,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:44:34 BoogieIcfgContainer [2024-10-11 10:44:34,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:44:34,986 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:44:34,987 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:44:34,987 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:44:34,987 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:44:31" (3/4) ... [2024-10-11 10:44:34,989 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:44:34,991 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:44:34,992 INFO L158 Benchmark]: Toolchain (without parser) took 4755.13ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 79.4MB in the beginning and 80.5MB in the end (delta: -1.1MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2024-10-11 10:44:34,992 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 151.0MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:44:34,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.25ms. Allocated memory is still 151.0MB. Free memory was 79.0MB in the beginning and 65.1MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 10:44:34,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.37ms. Allocated memory is still 151.0MB. Free memory was 64.9MB in the beginning and 62.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:44:34,995 INFO L158 Benchmark]: Boogie Preprocessor took 54.85ms. Allocated memory is still 151.0MB. Free memory was 62.4MB in the beginning and 59.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:44:34,996 INFO L158 Benchmark]: RCFGBuilder took 566.98ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 59.4MB in the beginning and 152.7MB in the end (delta: -93.3MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-10-11 10:44:34,996 INFO L158 Benchmark]: TraceAbstraction took 3728.23ms. Allocated memory is still 197.1MB. Free memory was 151.6MB in the beginning and 80.5MB in the end (delta: 71.1MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2024-10-11 10:44:34,996 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 197.1MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:44:34,998 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.12ms. Allocated memory is still 151.0MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.25ms. Allocated memory is still 151.0MB. Free memory was 79.0MB in the beginning and 65.1MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.37ms. Allocated memory is still 151.0MB. Free memory was 64.9MB in the beginning and 62.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.85ms. Allocated memory is still 151.0MB. Free memory was 62.4MB in the beginning and 59.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 566.98ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 59.4MB in the beginning and 152.7MB in the end (delta: -93.3MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3728.23ms. Allocated memory is still 197.1MB. Free memory was 151.6MB in the beginning and 80.5MB in the end (delta: 71.1MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 197.1MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 4.8; [L23] float var_1_4 = 255.1; [L24] float var_1_5 = -0.6; [L25] signed short int var_1_6 = -10; [L26] unsigned char var_1_8 = 1; [L27] signed char var_1_11 = -2; [L28] signed char var_1_12 = 10; [L29] signed char var_1_13 = 5; [L30] signed char var_1_14 = -1; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 0; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 5; [L35] unsigned char var_1_19 = 64; [L36] unsigned char var_1_20 = 5; [L37] unsigned char last_1_var_1_18 = 5; [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_18 = var_1_18 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L70] var_1_4 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L71] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L72] var_1_5 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L73] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L74] var_1_8 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10] [L75] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10] [L76] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L76] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L77] var_1_12 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L78] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L79] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L79] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L80] var_1_13 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L81] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L82] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L83] var_1_14 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L84] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L85] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L86] var_1_16 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L87] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L88] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L88] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L89] var_1_17 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L90] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L91] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L91] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L92] var_1_19 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_19 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8160, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8160, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L93] RET assume_abort_if_not(var_1_19 >= 32) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8160, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L94] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8160, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8160, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L94] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8160, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L95] var_1_20 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8160, var_1_1=24/5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8160, var_1_1=24/5, var_1_6=-10, var_1_8=0] [L96] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8160, var_1_1=24/5, var_1_6=-10, var_1_8=0] [L97] CALL assume_abort_if_not(var_1_20 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8160, var_1_1=24/5, var_1_20=32, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8160, var_1_1=24/5, var_1_20=32, var_1_6=-10, var_1_8=0] [L97] RET assume_abort_if_not(var_1_20 <= 32) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8160, var_1_1=24/5, var_1_20=32, var_1_6=-10, var_1_8=0] [L111] RET updateVariables() [L112] CALL step() [L41] signed long int stepLocal_0 = ~ last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=5, stepLocal_0=-6, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8160, var_1_1=24/5, var_1_20=32, var_1_6=-10, var_1_8=0] [L42] COND TRUE last_1_var_1_18 >= stepLocal_0 [L43] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8160, var_1_20=32, var_1_6=-10, var_1_8=0] [L45] unsigned char stepLocal_1 = (var_1_1 * var_1_5) >= var_1_4; VAL [isInitial=1, last_1_var_1_18=5, stepLocal_1=1, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=-8160, var_1_20=32, var_1_6=-10, var_1_8=0] [L46] COND TRUE var_1_17 && stepLocal_1 [L47] var_1_18 = (2 + ((var_1_19 - var_1_20) + 32)) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=34, var_1_19=-8160, var_1_20=32, var_1_6=-10, var_1_8=0] [L51] COND FALSE !(\read(var_1_8)) [L54] var_1_15 = (! var_1_17) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=34, var_1_19=-8160, var_1_20=32, var_1_6=-10, var_1_8=0] [L56] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=34, var_1_19=-8160, var_1_20=32, var_1_6=-10, var_1_8=0] [L59] COND FALSE !(\read(var_1_15)) [L66] var_1_6 = var_1_11 VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=34, var_1_19=-8160, var_1_20=32, var_1_6=-2, var_1_8=0] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((((last_1_var_1_18 >= (~ last_1_var_1_18)) ? (var_1_1 == ((float) (var_1_4 + var_1_5))) : 1) && (var_1_15 ? (var_1_15 ? (var_1_6 == ((signed short int) (var_1_11 + var_1_11))) : (var_1_6 == ((signed short int) (var_1_11 + var_1_11)))) : (var_1_6 == ((signed short int) var_1_11)))) && (var_1_15 ? (var_1_11 == ((signed char) ((var_1_12 + ((((10) < (var_1_13)) ? (10) : (var_1_13)))) + var_1_14))) : 1)) && (var_1_8 ? (var_1_15 == ((unsigned char) (! var_1_16))) : (var_1_15 == ((unsigned char) (! var_1_17))))) && ((var_1_17 && ((var_1_1 * var_1_5) >= var_1_4)) ? (var_1_18 == ((unsigned char) (2 + ((var_1_19 - var_1_20) + 32)))) : (var_1_18 == ((unsigned char) var_1_19))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=34, var_1_19=-8160, var_1_20=32, var_1_6=-2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=10, var_1_14=-43, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=34, var_1_19=-8160, var_1_20=32, var_1_6=-2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 5, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 264 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 510 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 269 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 246 IncrementalHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 241 mSDtfsCounter, 246 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 385 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=4, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 148 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 666 NumberOfCodeBlocks, 666 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 660 ConstructedInterpolants, 0 QuantifiedInterpolants, 1140 SizeOfPredicates, 2 NumberOfNonLiveVariables, 254 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 3618/3672 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:44:35,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aaf221d7158743008ea81fbb0e586b6f2b82c6a21578c56e13bae7eee02457d5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:44:37,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:44:37,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:44:37,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:44:37,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:44:37,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:44:37,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:44:37,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:44:37,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:44:37,463 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:44:37,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:44:37,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:44:37,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:44:37,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:44:37,468 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:44:37,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:44:37,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:44:37,469 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:44:37,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:44:37,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:44:37,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:44:37,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:44:37,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:44:37,471 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:44:37,472 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:44:37,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:44:37,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:44:37,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:44:37,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:44:37,473 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:44:37,474 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:44:37,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:44:37,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:44:37,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:44:37,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:44:37,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:44:37,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:44:37,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:44:37,477 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:44:37,477 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:44:37,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:44:37,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:44:37,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:44:37,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:44:37,478 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:44:37,479 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aaf221d7158743008ea81fbb0e586b6f2b82c6a21578c56e13bae7eee02457d5 [2024-10-11 10:44:37,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:44:37,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:44:37,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:44:37,841 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:44:37,841 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:44:37,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i [2024-10-11 10:44:39,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:44:39,680 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:44:39,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i [2024-10-11 10:44:39,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/90ef4fdbe/41e693c7f9e446aabce917dfd9e3d7a1/FLAGb092b7b6a [2024-10-11 10:44:39,706 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/90ef4fdbe/41e693c7f9e446aabce917dfd9e3d7a1 [2024-10-11 10:44:39,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:44:39,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:44:39,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:44:39,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:44:39,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:44:39,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:44:39" (1/1) ... [2024-10-11 10:44:39,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a817224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:39, skipping insertion in model container [2024-10-11 10:44:39,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:44:39" (1/1) ... [2024-10-11 10:44:39,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:44:39,914 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i[917,930] [2024-10-11 10:44:39,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:44:39,996 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:44:40,008 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-35.i[917,930] [2024-10-11 10:44:40,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:44:40,071 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:44:40,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:40 WrapperNode [2024-10-11 10:44:40,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:44:40,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:44:40,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:44:40,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:44:40,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:40" (1/1) ... [2024-10-11 10:44:40,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:40" (1/1) ... [2024-10-11 10:44:40,125 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-11 10:44:40,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:44:40,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:44:40,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:44:40,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:44:40,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:40" (1/1) ... [2024-10-11 10:44:40,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:40" (1/1) ... [2024-10-11 10:44:40,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:40" (1/1) ... [2024-10-11 10:44:40,177 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:44:40,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:40" (1/1) ... [2024-10-11 10:44:40,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:40" (1/1) ... [2024-10-11 10:44:40,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:40" (1/1) ... [2024-10-11 10:44:40,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:40" (1/1) ... [2024-10-11 10:44:40,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:40" (1/1) ... [2024-10-11 10:44:40,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:40" (1/1) ... [2024-10-11 10:44:40,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:44:40,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:44:40,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:44:40,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:44:40,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:40" (1/1) ... [2024-10-11 10:44:40,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:44:40,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:44:40,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:44:40,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:44:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:44:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:44:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:44:40,300 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:44:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:44:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:44:40,391 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:44:40,394 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:44:41,017 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:44:41,017 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:44:41,090 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:44:41,090 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:44:41,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:44:41 BoogieIcfgContainer [2024-10-11 10:44:41,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:44:41,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:44:41,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:44:41,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:44:41,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:44:39" (1/3) ... [2024-10-11 10:44:41,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e111982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:44:41, skipping insertion in model container [2024-10-11 10:44:41,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:44:40" (2/3) ... [2024-10-11 10:44:41,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e111982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:44:41, skipping insertion in model container [2024-10-11 10:44:41,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:44:41" (3/3) ... [2024-10-11 10:44:41,099 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-35.i [2024-10-11 10:44:41,115 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:44:41,115 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:44:41,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:44:41,180 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;@4fd65010, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:44:41,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:44:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:44:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 10:44:41,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:41,200 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:41,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:41,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:41,206 INFO L85 PathProgramCache]: Analyzing trace with hash -628824035, now seen corresponding path program 1 times [2024-10-11 10:44:41,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:44:41,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401510547] [2024-10-11 10:44:41,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:41,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:44:41,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:44:41,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:44:41,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:44:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:41,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:44:41,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:44:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-10-11 10:44:41,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:44:41,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:44:41,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401510547] [2024-10-11 10:44:41,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401510547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:41,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:41,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:44:41,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282367819] [2024-10-11 10:44:41,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:41,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:44:41,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:44:41,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:44:41,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:44:41,596 INFO L87 Difference]: Start difference. First operand has 48 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 10:44:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:42,063 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2024-10-11 10:44:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:44:42,075 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2024-10-11 10:44:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:42,081 INFO L225 Difference]: With dead ends: 93 [2024-10-11 10:44:42,081 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 10:44:42,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:44:42,088 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:42,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 10:44:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 10:44:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 10:44:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:44:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2024-10-11 10:44:42,133 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 111 [2024-10-11 10:44:42,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:42,133 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 69 transitions. [2024-10-11 10:44:42,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 10:44:42,134 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2024-10-11 10:44:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 10:44:42,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:42,137 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:42,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 10:44:42,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:44:42,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:42,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:42,340 INFO L85 PathProgramCache]: Analyzing trace with hash -855102303, now seen corresponding path program 1 times [2024-10-11 10:44:42,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:44:42,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916613875] [2024-10-11 10:44:42,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:42,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:44:42,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:44:42,342 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:44:42,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:44:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:42,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:44:42,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:44:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 10:44:42,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:44:42,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:44:42,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916613875] [2024-10-11 10:44:42,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916613875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:44:42,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:44:42,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:44:42,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151930322] [2024-10-11 10:44:42,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:44:42,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:44:42,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:44:42,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:44:42,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:42,692 INFO L87 Difference]: Start difference. First operand 46 states and 69 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:44:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:43,030 INFO L93 Difference]: Finished difference Result 91 states and 137 transitions. [2024-10-11 10:44:43,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:44:43,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2024-10-11 10:44:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:43,044 INFO L225 Difference]: With dead ends: 91 [2024-10-11 10:44:43,045 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 10:44:43,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:44:43,046 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:43,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:44:43,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 10:44:43,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 10:44:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:44:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2024-10-11 10:44:43,056 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 111 [2024-10-11 10:44:43,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:43,058 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2024-10-11 10:44:43,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 10:44:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2024-10-11 10:44:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 10:44:43,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:43,061 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:43,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 10:44:43,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:44:43,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:43,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:43,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1535160673, now seen corresponding path program 1 times [2024-10-11 10:44:43,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:44:43,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56769728] [2024-10-11 10:44:43,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:43,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:44:43,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:44:43,276 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:44:43,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:44:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:43,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 10:44:43,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:44:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 303 proven. 18 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-10-11 10:44:43,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:44:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-11 10:44:43,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:44:43,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56769728] [2024-10-11 10:44:43,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56769728] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:44:43,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:44:43,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-11 10:44:43,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787560534] [2024-10-11 10:44:43,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:44:43,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:44:43,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:44:43,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:44:43,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:44:43,987 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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-10-11 10:44:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:44:45,388 INFO L93 Difference]: Finished difference Result 203 states and 286 transitions. [2024-10-11 10:44:45,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 10:44:45,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 111 [2024-10-11 10:44:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:44:45,392 INFO L225 Difference]: With dead ends: 203 [2024-10-11 10:44:45,392 INFO L226 Difference]: Without dead ends: 158 [2024-10-11 10:44:45,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2024-10-11 10:44:45,394 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 112 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:44:45,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 191 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 10:44:45,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-11 10:44:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 52. [2024-10-11 10:44:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:44:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2024-10-11 10:44:45,414 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 111 [2024-10-11 10:44:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:44:45,415 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2024-10-11 10:44:45,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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-10-11 10:44:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2024-10-11 10:44:45,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 10:44:45,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:44:45,417 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:44:45,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 10:44:45,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:44:45,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:44:45,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:44:45,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1476055329, now seen corresponding path program 1 times [2024-10-11 10:44:45,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:44:45,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806238972] [2024-10-11 10:44:45,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:44:45,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:44:45,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:44:45,623 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:44:45,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 10:44:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:44:45,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 10:44:45,839 INFO L278 TraceCheckSpWp]: Computing forward predicates...