./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_13_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_13_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5fe128c552d151f840fd9658d925c54ad253cdccffe5141b08c3c88746ee3bf8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 10:40:04,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 10:40:04,974 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-12-02 10:40:04,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 10:40:04,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 10:40:05,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 10:40:05,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 10:40:05,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 10:40:05,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 10:40:05,001 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 10:40:05,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 10:40:05,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 10:40:05,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 10:40:05,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 10:40:05,002 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 10:40:05,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 10:40:05,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 10:40:05,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 10:40:05,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 10:40:05,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 10:40:05,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 10:40:05,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 10:40:05,003 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-12-02 10:40:05,003 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 10:40:05,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 10:40:05,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 10:40:05,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 10:40:05,003 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 10:40:05,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:40:05,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 10:40:05,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:40:05,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:40:05,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 10:40:05,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:40:05,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 10:40:05,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:40:05,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:40:05,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 10:40:05,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 10:40:05,004 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 10:40:05,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 10:40:05,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 10:40:05,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 10:40:05,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 10:40:05,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 10:40:05,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 10:40:05,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 10:40:05,005 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5fe128c552d151f840fd9658d925c54ad253cdccffe5141b08c3c88746ee3bf8 [2024-12-02 10:40:05,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 10:40:05,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 10:40:05,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 10:40:05,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 10:40:05,256 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 10:40:05,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_13_good.i [2024-12-02 10:40:07,869 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/data/36cf36ecc/1a7c84cf41374923b3e824f5cf99b761/FLAGaa28e2524 [2024-12-02 10:40:08,206 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 10:40:08,207 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_13_good.i [2024-12-02 10:40:08,226 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/data/36cf36ecc/1a7c84cf41374923b3e824f5cf99b761/FLAGaa28e2524 [2024-12-02 10:40:08,239 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/data/36cf36ecc/1a7c84cf41374923b3e824f5cf99b761 [2024-12-02 10:40:08,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 10:40:08,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 10:40:08,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 10:40:08,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 10:40:08,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 10:40:08,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:40:08" (1/1) ... [2024-12-02 10:40:08,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b7b1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:08, skipping insertion in model container [2024-12-02 10:40:08,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:40:08" (1/1) ... [2024-12-02 10:40:08,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 10:40:08,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:40:08,942 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 10:40:09,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:40:09,122 INFO L204 MainTranslator]: Completed translation [2024-12-02 10:40:09,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:09 WrapperNode [2024-12-02 10:40:09,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 10:40:09,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 10:40:09,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 10:40:09,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 10:40:09,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:09" (1/1) ... [2024-12-02 10:40:09,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:09" (1/1) ... [2024-12-02 10:40:09,166 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2024-12-02 10:40:09,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 10:40:09,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 10:40:09,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 10:40:09,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 10:40:09,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:09" (1/1) ... [2024-12-02 10:40:09,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:09" (1/1) ... [2024-12-02 10:40:09,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:09" (1/1) ... [2024-12-02 10:40:09,182 INFO L175 MemorySlicer]: No memory access in input program. [2024-12-02 10:40:09,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:09" (1/1) ... [2024-12-02 10:40:09,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:09" (1/1) ... [2024-12-02 10:40:09,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:09" (1/1) ... [2024-12-02 10:40:09,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:09" (1/1) ... [2024-12-02 10:40:09,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:09" (1/1) ... [2024-12-02 10:40:09,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:09" (1/1) ... [2024-12-02 10:40:09,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:09" (1/1) ... [2024-12-02 10:40:09,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 10:40:09,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 10:40:09,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 10:40:09,190 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 10:40:09,190 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:09" (1/1) ... [2024-12-02 10:40:09,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:40:09,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:40:09,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 10:40:09,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 10:40:09,234 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-12-02 10:40:09,234 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-12-02 10:40:09,234 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-12-02 10:40:09,234 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-12-02 10:40:09,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 10:40:09,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 10:40:09,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 10:40:09,351 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 10:40:09,352 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 10:40:09,497 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-12-02 10:40:09,497 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 10:40:09,505 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 10:40:09,505 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 10:40:09,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:40:09 BoogieIcfgContainer [2024-12-02 10:40:09,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 10:40:09,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 10:40:09,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 10:40:09,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 10:40:09,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:40:08" (1/3) ... [2024-12-02 10:40:09,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6b2cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:40:09, skipping insertion in model container [2024-12-02 10:40:09,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:09" (2/3) ... [2024-12-02 10:40:09,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6b2cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:40:09, skipping insertion in model container [2024-12-02 10:40:09,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:40:09" (3/3) ... [2024-12-02 10:40:09,513 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_sub_13_good.i [2024-12-02 10:40:09,525 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 10:40:09,526 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fscanf_sub_13_good.i that has 3 procedures, 59 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2024-12-02 10:40:09,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 10:40:09,575 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;@36616bed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 10:40:09,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-12-02 10:40:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 38 states have (on average 1.5) internal successors, (57), 50 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-12-02 10:40:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-02 10:40:09,582 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:40:09,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:40:09,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-12-02 10:40:09,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:09,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2010894524, now seen corresponding path program 1 times [2024-12-02 10:40:09,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:40:09,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098760896] [2024-12-02 10:40:09,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:09,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:40:09,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:40:09,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098760896] [2024-12-02 10:40:09,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098760896] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:40:09,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:40:09,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:40:09,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549745681] [2024-12-02 10:40:09,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:40:09,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:40:09,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:40:09,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:40:09,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:40:09,782 INFO L87 Difference]: Start difference. First operand has 59 states, 38 states have (on average 1.5) internal successors, (57), 50 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 10:40:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:40:09,819 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2024-12-02 10:40:09,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:40:09,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-12-02 10:40:09,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:40:09,826 INFO L225 Difference]: With dead ends: 108 [2024-12-02 10:40:09,826 INFO L226 Difference]: Without dead ends: 53 [2024-12-02 10:40:09,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-02 10:40:09,831 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:40:09,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 145 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:40:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-12-02 10:40:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2024-12-02 10:40:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.5) internal successors, (51), 44 states have internal predecessors, (51), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-12-02 10:40:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-12-02 10:40:09,861 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 12 [2024-12-02 10:40:09,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:40:09,861 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-12-02 10:40:09,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 10:40:09,861 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-12-02 10:40:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-02 10:40:09,862 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:40:09,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:40:09,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 10:40:09,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-12-02 10:40:09,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:09,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2086779133, now seen corresponding path program 1 times [2024-12-02 10:40:09,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:40:09,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940816267] [2024-12-02 10:40:09,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:09,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:40:09,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:40:09,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940816267] [2024-12-02 10:40:09,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940816267] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:40:09,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:40:09,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:40:09,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108492773] [2024-12-02 10:40:09,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:40:09,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:40:09,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:40:09,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:40:09,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:40:09,946 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 10:40:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:40:09,962 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2024-12-02 10:40:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:40:09,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-12-02 10:40:09,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:40:09,963 INFO L225 Difference]: With dead ends: 52 [2024-12-02 10:40:09,963 INFO L226 Difference]: Without dead ends: 51 [2024-12-02 10:40:09,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-02 10:40:09,964 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:40:09,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 112 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:40:09,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-12-02 10:40:09,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-12-02 10:40:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 43 states have internal predecessors, (50), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-12-02 10:40:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-12-02 10:40:09,971 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2024-12-02 10:40:09,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:40:09,971 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-12-02 10:40:09,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-12-02 10:40:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-12-02 10:40:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-02 10:40:09,972 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:40:09,972 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:40:09,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 10:40:09,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-12-02 10:40:09,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:09,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1299152580, now seen corresponding path program 1 times [2024-12-02 10:40:09,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:40:09,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709900663] [2024-12-02 10:40:09,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:09,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 10:40:10,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:40:10,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709900663] [2024-12-02 10:40:10,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709900663] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:40:10,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:40:10,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 10:40:10,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228535667] [2024-12-02 10:40:10,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:40:10,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:40:10,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:40:10,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:40:10,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:40:10,029 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 10:40:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:40:10,054 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2024-12-02 10:40:10,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:40:10,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-12-02 10:40:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:40:10,055 INFO L225 Difference]: With dead ends: 88 [2024-12-02 10:40:10,055 INFO L226 Difference]: Without dead ends: 46 [2024-12-02 10:40:10,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-02 10:40:10,056 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:40:10,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 44 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:40:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-12-02 10:40:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-12-02 10:40:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.25) internal successors, (40), 39 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-12-02 10:40:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-12-02 10:40:10,063 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 20 [2024-12-02 10:40:10,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:40:10,064 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-12-02 10:40:10,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-12-02 10:40:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-12-02 10:40:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-02 10:40:10,064 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:40:10,064 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:40:10,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 10:40:10,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-12-02 10:40:10,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:10,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1309135630, now seen corresponding path program 1 times [2024-12-02 10:40:10,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:40:10,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492125694] [2024-12-02 10:40:10,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:10,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 10:40:10,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:40:10,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492125694] [2024-12-02 10:40:10,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492125694] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:40:10,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:40:10,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:40:10,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192501529] [2024-12-02 10:40:10,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:40:10,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:40:10,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:40:10,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:40:10,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:40:10,124 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 10:40:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:40:10,138 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-12-02 10:40:10,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:40:10,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-12-02 10:40:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:40:10,140 INFO L225 Difference]: With dead ends: 46 [2024-12-02 10:40:10,140 INFO L226 Difference]: Without dead ends: 45 [2024-12-02 10:40:10,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-02 10:40:10,141 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:40:10,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:40:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-12-02 10:40:10,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-12-02 10:40:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.21875) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-12-02 10:40:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-12-02 10:40:10,146 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 21 [2024-12-02 10:40:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:40:10,147 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-12-02 10:40:10,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 10:40:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2024-12-02 10:40:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-02 10:40:10,147 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:40:10,148 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:40:10,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 10:40:10,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-12-02 10:40:10,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:10,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1928498952, now seen corresponding path program 1 times [2024-12-02 10:40:10,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:40:10,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850053250] [2024-12-02 10:40:10,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 10:40:10,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:40:10,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850053250] [2024-12-02 10:40:10,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850053250] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:40:10,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:40:10,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:40:10,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879921662] [2024-12-02 10:40:10,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:40:10,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:40:10,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:40:10,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:40:10,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:40:10,199 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 10:40:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:40:10,216 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-12-02 10:40:10,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:40:10,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-12-02 10:40:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:40:10,217 INFO L225 Difference]: With dead ends: 45 [2024-12-02 10:40:10,217 INFO L226 Difference]: Without dead ends: 44 [2024-12-02 10:40:10,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-02 10:40:10,218 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:40:10,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:40:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-12-02 10:40:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-12-02 10:40:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.1875) internal successors, (38), 37 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-12-02 10:40:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-12-02 10:40:10,224 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 22 [2024-12-02 10:40:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:40:10,224 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-12-02 10:40:10,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 10:40:10,224 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-12-02 10:40:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-02 10:40:10,225 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:40:10,225 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:40:10,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 10:40:10,225 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-12-02 10:40:10,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:10,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1193549525, now seen corresponding path program 1 times [2024-12-02 10:40:10,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:40:10,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754787567] [2024-12-02 10:40:10,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:10,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 10:40:10,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:40:10,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754787567] [2024-12-02 10:40:10,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754787567] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:40:10,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:40:10,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:40:10,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950417802] [2024-12-02 10:40:10,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:40:10,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:40:10,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:40:10,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:40:10,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:40:10,273 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-12-02 10:40:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:40:10,289 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-12-02 10:40:10,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:40:10,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-12-02 10:40:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:40:10,290 INFO L225 Difference]: With dead ends: 44 [2024-12-02 10:40:10,291 INFO L226 Difference]: Without dead ends: 43 [2024-12-02 10:40:10,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-02 10:40:10,291 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:40:10,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:40:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-12-02 10:40:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-12-02 10:40:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.15625) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-12-02 10:40:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-12-02 10:40:10,297 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 29 [2024-12-02 10:40:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:40:10,297 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-12-02 10:40:10,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-12-02 10:40:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-12-02 10:40:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-02 10:40:10,298 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:40:10,298 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:40:10,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 10:40:10,298 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-12-02 10:40:10,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:10,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1654670499, now seen corresponding path program 1 times [2024-12-02 10:40:10,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:40:10,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523167164] [2024-12-02 10:40:10,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:10,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 10:40:10,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:40:10,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523167164] [2024-12-02 10:40:10,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523167164] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:40:10,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:40:10,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:40:10,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656625724] [2024-12-02 10:40:10,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:40:10,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:40:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:40:10,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:40:10,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:40:10,341 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-12-02 10:40:10,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:40:10,355 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-12-02 10:40:10,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:40:10,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-12-02 10:40:10,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:40:10,356 INFO L225 Difference]: With dead ends: 43 [2024-12-02 10:40:10,356 INFO L226 Difference]: Without dead ends: 42 [2024-12-02 10:40:10,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-02 10:40:10,357 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:40:10,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:40:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-12-02 10:40:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-12-02 10:40:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-12-02 10:40:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-12-02 10:40:10,362 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 30 [2024-12-02 10:40:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:40:10,362 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-12-02 10:40:10,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-12-02 10:40:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-12-02 10:40:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-02 10:40:10,363 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:40:10,364 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 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-12-02 10:40:10,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 10:40:10,364 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-12-02 10:40:10,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:10,364 INFO L85 PathProgramCache]: Analyzing trace with hash 447056466, now seen corresponding path program 1 times [2024-12-02 10:40:10,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:40:10,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798038123] [2024-12-02 10:40:10,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:10,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 10:40:10,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:40:10,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798038123] [2024-12-02 10:40:10,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798038123] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:40:10,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:40:10,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:40:10,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928512174] [2024-12-02 10:40:10,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:40:10,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:40:10,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:40:10,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:40:10,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:40:10,401 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-12-02 10:40:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:40:10,408 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-12-02 10:40:10,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:40:10,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-12-02 10:40:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:40:10,409 INFO L225 Difference]: With dead ends: 42 [2024-12-02 10:40:10,410 INFO L226 Difference]: Without dead ends: 41 [2024-12-02 10:40:10,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-02 10:40:10,410 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:40:10,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:40:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-12-02 10:40:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-12-02 10:40:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-12-02 10:40:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-12-02 10:40:10,415 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 39 [2024-12-02 10:40:10,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:40:10,415 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-12-02 10:40:10,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-12-02 10:40:10,415 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-12-02 10:40:10,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-02 10:40:10,416 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 10:40:10,416 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-12-02 10:40:10,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 10:40:10,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-12-02 10:40:10,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash 973848687, now seen corresponding path program 1 times [2024-12-02 10:40:10,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:40:10,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714946316] [2024-12-02 10:40:10,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:10,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 10:40:10,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:40:10,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714946316] [2024-12-02 10:40:10,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714946316] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:40:10,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:40:10,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:40:10,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259732552] [2024-12-02 10:40:10,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:40:10,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:40:10,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:40:10,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:40:10,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:40:10,459 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-12-02 10:40:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:40:10,465 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-12-02 10:40:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:40:10,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-12-02 10:40:10,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 10:40:10,466 INFO L225 Difference]: With dead ends: 41 [2024-12-02 10:40:10,466 INFO L226 Difference]: Without dead ends: 0 [2024-12-02 10:40:10,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-02 10:40:10,467 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 10:40:10,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 10:40:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-12-02 10:40:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-12-02 10:40:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:40:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-12-02 10:40:10,468 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2024-12-02 10:40:10,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 10:40:10,468 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-12-02 10:40:10,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-12-02 10:40:10,468 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-12-02 10:40:10,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-02 10:40:10,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-12-02 10:40:10,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-12-02 10:40:10,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-12-02 10:40:10,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-12-02 10:40:10,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-12-02 10:40:10,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-12-02 10:40:10,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-12-02 10:40:10,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-12-02 10:40:10,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 10:40:10,475 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:40:10,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-12-02 10:40:10,504 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 10:40:10,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:40:10 BoogieIcfgContainer [2024-12-02 10:40:10,508 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 10:40:10,508 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 10:40:10,509 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 10:40:10,509 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 10:40:10,509 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:40:09" (3/4) ... [2024-12-02 10:40:10,511 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-02 10:40:10,515 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-12-02 10:40:10,515 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-12-02 10:40:10,517 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-12-02 10:40:10,517 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-12-02 10:40:10,518 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-12-02 10:40:10,518 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-02 10:40:10,584 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 10:40:10,584 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 10:40:10,584 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 10:40:10,585 INFO L158 Benchmark]: Toolchain (without parser) took 2342.04ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 52.5MB in the end (delta: 61.2MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2024-12-02 10:40:10,585 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:40:10,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 878.93ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 54.6MB in the end (delta: 58.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-12-02 10:40:10,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.77ms. Allocated memory is still 142.6MB. Free memory was 54.4MB in the beginning and 113.1MB in the end (delta: -58.7MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-12-02 10:40:10,586 INFO L158 Benchmark]: Boogie Preprocessor took 22.47ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 111.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:40:10,586 INFO L158 Benchmark]: RCFGBuilder took 316.34ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 97.2MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 10:40:10,586 INFO L158 Benchmark]: TraceAbstraction took 1001.01ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 57.7MB in the end (delta: 38.9MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-12-02 10:40:10,587 INFO L158 Benchmark]: Witness Printer took 75.79ms. Allocated memory is still 142.6MB. Free memory was 57.7MB in the beginning and 52.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 10:40:10,588 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.29ms. Allocated memory is still 142.6MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 878.93ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 54.6MB in the end (delta: 58.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.77ms. Allocated memory is still 142.6MB. Free memory was 54.4MB in the beginning and 113.1MB in the end (delta: -58.7MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.47ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 111.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 316.34ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 97.2MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1001.01ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 57.7MB in the end (delta: 38.9MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * Witness Printer took 75.79ms. Allocated memory is still 142.6MB. Free memory was 57.7MB in the beginning and 52.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 59 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 830 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 373 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 457 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 60/60 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-12-02 10:40:10,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a68ea156-29ee-412d-b9a7-7774bdee6fdc/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE